In this note we present as well necessary as sufficient conditions for existence of a Pareto optimum for general non-convex differential games. The obtained results are used to analyze the non-convex regular indefinite linear quadratic differential game. For the scalar case an algorithm is devised to find all Pareto efficient solutions.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
2007-42.
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Related research
Keywords:
Find related papers by JEL classification: C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)