We analyze a pure bargaining problem when decisions require simple majority and self interested players make unilateral demands. In contrast to the case where proposals consist of complete sharing profiles, this content of proposals prevents implicit side-payments inside the committee, and so...

We present a game in which n persons split a cake, where a distinction between conditional and unconditional offers is made. This distinction sheds light on the contrasting results obtained in the previous literature of multilateral bargaining. By allowing the proposer to make both conditional...

We discuss a competitive (labor) market where firms face capacity constraints and individuals differ according to their productivity. Firms offer two-dimensional contracts like wage and task level. Then workers choose firms and contracts. Workers might be rationed if the number of applicants...

A mechanism that is both efficient and incentive compatible in the Bayesian-Nash sense is shown to be payoff-equivalent to a Groves mechanism at the point in time when each agent has just acquired his private information. This equivalence result simplifies the question of whether or not an...

A well-known result in incentive theory is that for a very broad class of decision problems, there is no mechanism which achieves truth-telling in dominant strategies, efficiency and budget balancedness (or first best implementability). On the contrary, Mitra and Sen (1998), prove that linear...

This paper deals with N-person sequential bargaining games with complete information. For N-person sequential bargaining games, uniqueness of the SPE has been obtained by allowing the players to exit with partial agreements. Adopting a non-equilibrium approach, we show that N-person sequential...

In the proto-coalition model of government formation, formateur F appoints a proto-coalition and asks its members whether to start negotiating a coalition contract. If all accept, then the proto-coalition forms and starts negotiating; otherwise, a caretaker government assumes office. I extend...

This paper provides an axiomatic characterization of a family of so-called efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin...

For a two-sided multipartner matching model where agents are given by path-independent choice functions and no quota restrictions, Blair [7] had shown that stable matchings always exist and form a lattice. However, the lattice operations were not simple and not distributive. Recently Alkan [3]...

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function....