Every agent reports his willingness to pay for one unit of good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

A simplified mechanism is a direct mechanism modified by restricting the set of reports or bids. An example is the auction used to place ads on Internet search pages, in which each advertiser bids a single price to determine the allocation of eight or more ad positions on a page. If a simplified...

A mechanism can be simplified by restricting its message space. If the restricted message space satisfies a certain “outcome closure property,” then the simplification is “tight”: for every S=0 any Nash equilibrium of the simplified mechanism is also an Nash equilibrium of the...

A group of actors, individuals or firms, can engage in collectively providing projects which may be costly or generating revenues and which may benefit some and harm others. Based on requirements of procedural fairness (Güth and Kliemt, 2013), we derive a bidding mechanism determining...

This paper considers procurement auctions with costly bidding when the auctioneer is unable to commit himself to restrict the number of bidders. The auctioneer can, however, offer a financial reward to be paid to every short-listed bidders as an indirect commitment device. Rewards for...

A principal uses security bid auctions to award an incentive contract to one among several agents, in the presence of hidden action and hidden information. Securities range from cash to equity and call options. “Steeper†securities are better surplus extractors that narrow the gap...

In a bargaining setting with asymmetrically informed, inequity-averse parties, a fully efficient mechanism (i.e., the double auction) exists if and only if compassion is strong. Less compassionate parties do not trade in the double auction in the limit of strong envy.

This paper develops a payoff equivalence theorem for mechanisms with ambiguity averse participants with preferences of the Maxmin Expected Utility (MEU) form (Gilboa and Schmeidler, 1989). We use our payoff equivalence result to explicitly characterize the revenue maximizing private value...

Often an organization or government must allocate goods without collecting payment in return. This may pose a difficult problem either when agents receiving those goods have private information in regards to their values or needs. In this paper, we find an optimal mechanism to allocate goods...

None available