Skip to main content

Auctions for Partial Heterogeneous Preferences

  • Conference paper
Mathematical Foundations of Computer Science 2013 (MFCS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8087))

Abstract

Online privacy provides fresh motivations to generalized auctions where: (i) preferences over bids may be partial, because of lack of knowledge and formalization difficulties; (ii) the preferences of auctioneers and bidders may be heterogeneous and unrelated. We tackle these generalized scenarios by introducing a few natural generalizations of second-price auctions, and by investigating which of their classical properties are preserved under which conditions.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aumann, R.J.: Subjective programming. Econometric Res. Prog. Research memorandum n. 22. Princeton University (February 10, 1961); Also in Shelly, M.W., Bryan, G.L. (eds.) Human Judgments and Optimality. Wiley, New York (1964)

    Google Scholar 

  2. Aumann, R.J.: Utility theory without the completeness axiom. Econometric Res. Prog. Research memorandum n. 26. Princeton University (April 3, 1961)

    Google Scholar 

  3. Bonatti, P.A., Faella, M., Galdi, C., Sauro, L.: Towards a mechanism for incentivating privacy. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 472–488. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Cranor, L.F., Resnick, P., Resnick, P.: Protocols for automated negotiations with buyer anonymity and seller reputations. Netnomics 2(1), 1–23 (2000)

    Article  Google Scholar 

  5. Fishburn, P.: Utility Theory for Decision Making. Wiley, New York (1970)

    MATH  Google Scholar 

  6. Harrenstein, P., de Weerdt, M., Conitzer, V.: A qualitative vickrey auction. In: Chuang, J., Fortnow, L., Pu, P. (eds.) ACM Conference on Electronic Commerce, pp. 197–206. ACM (2009)

    Google Scholar 

  7. Hatfield, J.W., Milgrom, P.R.: Matching with contracts. American Economic Review, 913–935 (2005)

    Google Scholar 

  8. Myerson, R.: Game Theory: Analysis of Conflict. Harvard University Press (1997)

    Google Scholar 

  9. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  MATH  Google Scholar 

  10. Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)

    Google Scholar 

  11. Reffgen, A.: Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness. Social Choice and Welfare 37(1), 39–59 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Simon, H.: A behavioral model of rational choice. The Quarterly Journal of Economics 69(1), 99–118 (1955)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonatti, P.A., Faella, M., Galdi, C., Sauro, L. (2013). Auctions for Partial Heterogeneous Preferences. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40313-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40312-5

  • Online ISBN: 978-3-642-40313-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics