We propose a simple mechanism to determine how the surplus generated by cooperation is to be shared in zero-monotonic environments with transferable utility. The mechanism consists of a bidding stage followed by a proposal stage. We show that the subgame perfect equilibrium outcomes of this mechanism coincide with the vector of the Shapley value payoffs. We extend our results to implement the weighted Shapley values. Finally, we generalize our mechanism to handle arbitrary transferable utility environments. The modified mechanism generates an efficient coalition structure, and implements the Shapley values of the superadditive cover of the environment.

No abstract

No abstract

We analyze situations in which a group of agents (and possibly a designer) have to reach a decision that will affect all the agents. Examples of such scenarios include the selection of a candidate, the location of a nuclear reactor or the siting of a major sports event. To address the problem of reaching a decision, we propose a one-stage multi-bidding mechanism in which agents submit bids to determine the winning project. All Nash equilibria of this mechanism are efficient and immune to any coalitional deviations.Moreover, the payoffs attained in equilibrium by the agents satisfy intuitively appealing lower bounds. (JEL D78, D62) 2 Reaching decisions about the location of noxious facilities, such as dump-sites, environmentally hazardous plants, nuclear power generators and the like, is a highly contentious issue. For instance, in February 2000, the US Senate decided that nationwide

We study all-pay auctions with variable rewards under incomplete information. In standard models, a reward depends on a bidder!s privately known type; however, in our model it is also a function of his bid. We show that in such models there is a potential for paradoxical behavior where a reduction in the rewards or an increase in costs may increase the expected sum of bids or alternatively the expected highest bid.