Computing open-loop noncooperative solution in discrete dynamic games
dc.citation.epage | 40 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 23 | en_US |
dc.citation.volumeNumber | 7 | en_US |
dc.contributor.author | Özyildirim, S. | en_US |
dc.date.accessioned | 2016-02-08T10:46:40Z | |
dc.date.available | 2016-02-08T10:46:40Z | |
dc.date.issued | 1997 | en_US |
dc.department | Department of Economics | en_US |
dc.department | Department of Management | en_US |
dc.description.abstract | The purpose of this paper is to introduce a new algorithm for the approximation of non-quadratic, non-linear open-loop Nash Cournot equilibrium in a difference game of fixed duration (multiperiod) and initial state. The algorithm based on adaptive search procedure called genetic algorithm has been used to optimize strategies for N-person dynamic games. Since genetic algorithms require little knowledge of the problem itself, computations based on these algorithms are very attractive to complex dynamic optimization problems. The empirical evidences are also provided to show the success of the algorithm developed. A typical example in US macroeconomic policy selection for 1933-1936 yields evidence of political inference in the economy. | en_US |
dc.identifier.eissn | 1432-1386 | |
dc.identifier.issn | 0936-9937 | |
dc.identifier.uri | http://hdl.handle.net/11693/25548 | |
dc.language.iso | English | en_US |
dc.publisher | Springer | en_US |
dc.source.title | Journal of Evolutionary Economics | en_US |
dc.subject | Discrete dynamic game | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Open-loop strategies | en_US |
dc.title | Computing open-loop noncooperative solution in discrete dynamic games | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Computing open-loop noncooperative solution in discrete dynamic games.pdf
- Size:
- 292.69 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version