Skip to main content

Responsive Lotteries

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6386))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, F.: Discovering personal probabilities when utility functions are unknown. Management Science 33(4), 542–544 (1989)

    Article  MathSciNet  Google Scholar 

  2. Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. In: STOC 2006, pp. 644–652 (2006)

    Google Scholar 

  3. Gneiting, T., Raftery, A.: Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association 102, 359–378 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kahneman, D., Tversky, A.: Prospect Theory: An Analysis of Decision under Risk. Econometrica XLVII, 263–291 (1979)

    Google Scholar 

  5. Mas-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  6. McCarthy, J.: Measures of the value of information. Proceedings of the National Academy of Sciences 42, 654–655 (1956)

    Article  MATH  Google Scholar 

  7. von Neumann, J., Morgenstern, O.: Theory of games and economic behavior, 3rd edn. Princeton University Press, Princeton (1954)

    MATH  Google Scholar 

  8. Nisan, N., Roughgarden, T.: Eva Tardos and Vijay Vazirani. Algorithmic Game Theory, Cambridge (2007)

    Google Scholar 

  9. Savage, L.J.: Elicitation of personal probabilities and expectations. Journal of the American Statistical Association 66, 783–801 (1971)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feige, U., Tennenholtz, M. (2010). Responsive Lotteries. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds) Algorithmic Game Theory. SAGT 2010. Lecture Notes in Computer Science, vol 6386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16170-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16170-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16169-8

  • Online ISBN: 978-3-642-16170-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics