Showing 1 - 10 of 73
Persistent link: https://www.econbiz.de/10005598445
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of...
Persistent link: https://www.econbiz.de/10010862611
A basic model of commitment is to convert a two-player game in strategic form to a leadership game with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex...
Persistent link: https://www.econbiz.de/10008469392
This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise...
Persistent link: https://www.econbiz.de/10005231876
A basic model of commitment is to convert a two-player game in strategic form to a "leadership game" with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex...
Persistent link: https://www.econbiz.de/10008494985
This paper compares the leader and follower payoff in a duopoly game, as they arise in sequential play, with the Nash payoff in simultaneous play. If the game is symmetric, has a unique symmetric Nash equilibrium, and players' payoffs are monotonic in the opponent's choice along their own best...
Persistent link: https://www.econbiz.de/10008494994
Persistent link: https://www.econbiz.de/10005066771
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/10005461602
Starting with the analysis of arms control and disarmament problems in the sixties, inspection games have evolved into a special area of game theory with specific theoretical aspects, and, equally important, practical applications in various fields of human activity where inspection is...
Persistent link: https://www.econbiz.de/10005461642
Persistent link: https://www.econbiz.de/10005408743