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

There has been a long debate on equilibrium characterization in the negotiation model when players have different time preferences. We show that players behave quite differently under different time preferences than under common time preferences. Conventional analysis in this literature relies...

Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly? A large literature in behavioral game theory has proposed and experimentally tested various learning algorithms, but a comparative analysis of their equilibrium convergence properties is lacking....