Hyperbolicity of systems describing value functions in differential games which model duopoly problems
Journal Title: Decision Making in Manufacturing and Services - Year 2015, Vol 9, Issue 1
Abstract
Based on the Bressan and Shen approach ([2] or [7]), we present the extension of the class of non-zero sum dierential games for which value functions are described by a weakly hyperbolic Hamilton-Jacobi system. The considered value functions are determined by a Pareto optimality condition for instantaneous gain functions, for which we compare two methods of the unique choice Pareto optimal strategies. We present the procedure of applying this approach for duopoly.
Authors and Affiliations
Joanna Zwierzchowska
Keywords
Related Articles
- EP ID EP420112
- DOI 10.7494/dmms.2015.9.1.89
- Views 63
- Downloads 0
Balancing Bilinearly Interfering Elements
Many decisions in various fields of application have to take into account the joined effects of two elements that can interfere with each other. This happens for example in Medicine (synergic or antagonistic drugs ), in...
The Art and Science of Modeling Decision-Making Under Severe Uncertainty
For obvious reasons, models for decision-making under severe uncertainty are austere. Simply put, there is precious little to work with under these conditions. This fact highlights the great importance of utilizing in su...
Models and Tools for Improving Efficiency in Constraint Logic Programming
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of...
Developing and Deploying Electronics Assembly Line Optimization Tools: A Motorola Case Study
The assignment of workloads to production equipment is one category of planning decision for an electronics assembly factory. In practice, line balancing requires not only selecting machines with sufficient placement acc...
On Efficient Coloring of Chordless Graphs
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff a graph obtained by joining e to path P (cycle C) has exactly two vertices of degree 3. A class of graphs without any ch...