Suppose Player A is playing two apparently independent repeated games with two other people, B and C, with A randomly matched, each period, with either B or C. Each dyad maintains the maximum incentive-compatible level of cooperation within the dyad, even if cooperation has broken down in the...

Morelli (American Political Science Review, 1999) provides a majoritarian bargaining model in which the parties make payoff demands and the order of moves is chosen by the leading party. Morelli's main proposition states that the ex post distribution of payoffs inside the coalition that forms is...

Cooperative and noncooperative games have no representation of players's basis utilities. Basis utility is the natural reference point on a player's utility scale that enables the determination the marginal utility of any payoff or allocation. A player's basis utility can be determined by an...

In a repeated game with private information, a perfect public equilibrium (PPE) can break down if communication is not necessarily simultaneous or if players can “spy” on each others’ information. An ex post perfect public equilibrium (EPPPE) is a PPE that is ex post incentive compatible...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

In this paper we show that it is possible to manipulate market equilibria in an economy with profit maximizing agents (or agents with quasi-linear utility functions) by either destroying or withholding ones initial endowments.

In this paper we study the restriction, to the class of bargaining problems with coalition structure, of several values which have been proposed on the class of non-transferable utility games with coalition structure. We prove that all of them coincide with the solution independently studied in...

This short paper isolates a non-trivial class of games for which there exists a monotone relation between the size of pure strategy spaces and the number of pure Nash equilibria (Theorem). This class is that of two- player nice games, i.e., games with compact real intervals as strategy spaces...

This paper addresses the question of whether neural networks, a realistic cognitive model of the human information processing, can learn to backward induce in a two stage game with a unique subgame-perfect Nash Equilibrium. The result that the neural networks only learn a heuristic that...

In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous— time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a...