This research states the stylised n (more than two) players' splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...

The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper is the first to introduce a globally convergent algorithm that fully exploits the differentiability present in the problem. It presents an everywhere differentiable homotopy to...

We consider a class of perfect information unanimity bargaining games, where the players have to choose a payoff vector from a fixed set of feasible payoffs. The proposer and the order of the responding players is determined by a state that evolves stochastically over time. The probability...

Diermeier and Fong (2008a) recently proposed a legislative bargaining model with reconsideration in the context of a distributive policy environment. In this paper we prove general existence and necessary conditions for pure-strategy stationary equilibria for any finite policy space and...

Introduction to Strategic Form Games -- Dominance -- Rationalizability -- Nash Equilibrium -- Perfect Equilibrium -- Evolutionary Stable Strategies -- Correlated Equilibrium -- Bayesian Nash Equilibrium -- Introduction to Extensive Form Games -- Subgame Perfect Nash Equilibrium -- Sequential...