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...

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...

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...

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...

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...

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...