Given a set of alternatives and a single player, we introduce the notion of a responsive lottery. These mechanisms receive as input from the player a reported utility function, specifying a value for each one of the alternatives, and use a lottery to produce as output a probability distribution over the alternatives. Thereafter, exactly one alternative wins (is given to the player) with the respective probability. Assuming that the player is not indifferent to which of the alternatives wins, a lottery rule is called truthful dominant if reporting his true utility function (up to affine transformations) is the unique report that maximizes the expected payoff for the player. We design truthful dominant responsive lotteries. We also discuss their relations with scoring rules and with VCG mechanisms. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Feige, U., & Tennenholtz, M. (2010). Responsive lotteries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6386 LNCS, pp. 150–161). https://doi.org/10.1007/978-3-642-16170-4_14
Mendeley helps you to discover research relevant for your work.