Showing 1 - 10 of 12,540
In part I of this paper, we proposed a Mixed-Integer Linear Program (MILP) to analyze imperfect competition of oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes the proposed MILP model into several subproblems and...
Persistent link: https://www.econbiz.de/10011943407
In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is based on...
Persistent link: https://www.econbiz.de/10013076437
This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that …
Persistent link: https://www.econbiz.de/10011526540
Persistent link: https://www.econbiz.de/10013416414
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split. Moreover, the division takes at most n cuts, which is best possible. This extends...
Persistent link: https://www.econbiz.de/10011569033
Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...
Persistent link: https://www.econbiz.de/10003612880
This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games. The games may be given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game, and provides an elementary proof that a Nash...
Persistent link: https://www.econbiz.de/10014024500
Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games. Through use of the Nikaido-Isoda function, the Nash solution to a broad category of constrained, multiplayer, non-zerosum games can easily be found. We provide solutions to some...
Persistent link: https://www.econbiz.de/10014066996
From a variant of Kuhn's triangulation we derive a discrete version of the Global Newton Method that yields an epsilon-equilibrium of an N-player game and then sequentially reduces epsilon toward zero to obtain any desired precision or the best precision for any number of iterations
Persistent link: https://www.econbiz.de/10012724858
lattice theory, we revisit the interchangeability and monotone properties of Nash equilibria in two-person games. We show that …
Persistent link: https://www.econbiz.de/10013220760