We consider the problem where agents bargain over their shares of a perfectly divisible commodity. The aim of this paper is to identify the class of bargaining solutions induced by dominant strategy implementable allocation rules. To this end, we characterize the class of dominant strategy...

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

Studying the interactions between preference and capacity manipulation in matching markets, we prove that acyclicity is a necessary and sufficient condition that guarantees the stability of a Nash equilibrium and the strategy-proofness of truthful capacity revelation under the hospital-optimal...

Ordinally single-peaked preferences are distinguished from cardinally single-peaked preferences, in which all players have a similar perception of distances in some one-dimensional ordering. While ordinal single-peakedness can lead to disconnected coalitions that have a "hole" in the ordering,...

I propose a general power index in games. The power of an agent over an outcome is understood as the equilibrium effect on the outcome of variations in the agent’s preferences. I show that the new index, ∆, has the following properties: (i) classic measures of freedom of choice are a special...

In a market with indivisibilities, Roth and Postlewaite (1977) show that the (weak) core can suffer from instability problems, in the sense that groups of individuals might upset the equilibrium by recontracting among themselves. By contrast, the strong core is stable. Following the seminal...

A new feature pertaining to proposer's ability to implement offers is introduced in the extensive form bargaining mechanism studied in Chatterjee et. al. (1993). This mechanism is used to analyze two classes of coalitional games with transferable utility. One class is that of strictly...

We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the “name” but not the ”type” of the other...

We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the "name" but not the "type" of the other...