Showing 1 - 10 of 2,056
Intuitively, we expect that players who are allowed to engage in costless communication before playing a game would be … foolish to agree on an inefficient equilibrium. At the same time, however, such preplay communication has been suggested as a … communication among players leads to a Nash equilibrium (NE) of the action game. Within the set of NE, efficiency then turns out to …
Persistent link: https://www.econbiz.de/10009511713
We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove convergence of the method we require a certain amount of noise in the system....
Persistent link: https://www.econbiz.de/10013217478
We show that a set of outcomes outside the convex hull of Nash equilibria can be asymptotically stable with respect to convex monotonic evolutionary dynamics. Boundedly rational agents receive signals and condition the choice of strategies on the signals. A set of conditional strategies is...
Persistent link: https://www.econbiz.de/10003782353
Many conditions have been introduced to weaken the continuity re-quirements for equilibrium existence in games. We introduce a new con-dition, called regularity, that is simple and easy to verify. It is implied both by Reny's better-reply security and Simon and Zame's endogenous sharing rule...
Persistent link: https://www.econbiz.de/10003886176
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...
Persistent link: https://www.econbiz.de/10008688945
In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...
Persistent link: https://www.econbiz.de/10008688967
It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...
Persistent link: https://www.econbiz.de/10010516648
We introduce a form of pre-play communication that we call preopening. During the preopening, players announce their …
Persistent link: https://www.econbiz.de/10011380033
We propose a meta-heuristic approach for solving nonlinear dynamic tracking games. In contrast to more "traditional" methods based on linear-quadratic (LQ) techniques, this derivative-free method is very flexible (e.g. to introduce inequality constraints). The meta-heuristic is applied to a...
Persistent link: https://www.econbiz.de/10011298509
The Nash bargaining solution of a modified bargaining problem in the contract space yields the pair of stationary subgame perfect equilibrium proposals in the alternating offers model, also for positive time between proposals. As time vanishes, convergence to the Nash bargaining solution is...
Persistent link: https://www.econbiz.de/10011343949