An allocation rule is called Bayes-Nash incentive compatible, if there exists a payment rule, such that truthful reports of agents’ types form a Bayes-Nash equilibrium in the directrevelation mechanism consisting of the allocation rule and the payment rule. This paperprovides characterizations...

We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running timeof the auction is infinite for almost all realizations of valuations of the bidders. We also show that this result...

This paper is concerned with a combinatorial, multi-attribute procurement mechanism called combinatorial scoring auction. In the setting that we analyze, private information of the suppliers is multi-dimensional. The buyer wants to procure several items at once. Subsets of these items are...

In this paper we present a new auction, the bisection auction, that can be used for the sale of a single indivisible object. We discuss the issue concerning the information revelation requirement of this auction and the associated amount of data that needs to be transmitted. We show that in the...

This paper is concerned with the number of profiles at which a nondictatorial social choice function is manipulable. For three or more alternatives the lower bound is derived when the social choice function is nondictatorial and unanimous. In the case of three alternatives the lower bound is...

Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...

Curb sets [Basu and Weibull, Econ. Letters 36 (1991), 141-146] are product sets of pure strategies containing all individual best-responses against beliefs restricted to the recommendations to the remaining players. The concept of minimal curb sets is a set-theoretic coarsening of the notion of...

In the theory of judgment aggregation, it is known for which agendas of propositions it is possible to aggregate individual judgments into collective ones in accordance with the Arrow-inspired requirements of universal domain, collective rationality, unanimity preservation, non-dictatorship and...

In this survey we analyze, and compare, various sufficient epistemic conditions for backward induction that have been proposed in the literature. To this purpose we present a simple epistemic base model for games with perfect information, and translate the different models into the language of...

Domains of individual preferences for which the well-known impossibility theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. To comprehend the limitations these results imply for social choice rules, we search for the largest domains that are possible. Here, we...