We study both theoretically and experimentally the set of Nash equilibria of a classical one-dimensional election game with two candidates. These candidates are interested in power and ideology, but their weights on these two motives are not necessarily identical. Apart from obtaining the well...

We consider the “airport problem”, which is concerned with sharing the cost of an airstrip among agents who need airstrips of different lengths. We investigate the implications of two properties, Left-endpoint Subtraction (LS) bilateral consistency and LS converse consistency, in the airport...

This paper takes the idea of coalitional behavior – groups of people occasionally acting together to their mutual benefit – and incorporates it into the framework of evolutionary game theory that underpins the social learning literature. An equilibrium selection criterion is defined which we...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

Sengupta and Sengupta (1996) study the accessibility of the core of a TU game and show that the core, if non-empty, can be reached from any non-core allocation via a finite sequence of successive blocks. This paper complements the result by showing that when the core is empty, a number of...

We study a setting in which imitative players are matched into pairs to play a Prisonerʼs Dilemma game. A well-known result in such setting is that under random matching cooperation vanishes for any interior initial condition. The novelty of this paper is that we consider partial rematching:...

The study of coalition formation under uncertainty poses subtle questions regarding the appropriate definition of the core. In this paper a new core concept, the interim sequential core (ISC), is proposed as a solution concept to transferable utility games with uncertainty when binding...

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions...

This note analyzes a two-player all-pay auction with incomplete information. More precisely, one bidder is uncertain about the size of the initial advantage of his rival modeled as a head start in the auction.

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...