Skip to main content

Truthful Mechanisms for One-Parameter Agents

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 74 Accesses

Synonyms

Dominant strategy mechanisms; Incentive compatible mechanisms; Single-parameter agents; Truthful auctions

Years and Authors of Summarized Original Work

  • 2001; Archer, Tardos

Problem Definition

This problem is concerned with designing truthful (dominant strategy) mechanisms for domains where each agent’s private information is expressed by a single positive real number. The goal of the mechanisms is to allocate loads placed on the agents, and an agent’s private information is the cost incurred per unit load. Archer and Tardos [4] give an exact characterization for the algorithms that can be used to design truthful mechanisms for such load balancing problems using appropriate payments. The characterization shows that the allocated load must be monotonic in the cost (decreasing when the cost on an agent increases, fixing the costs of the others). Thus, truthful mechanisms are characterized by a condition on the allocation rule, and payments that ensure voluntary participation can...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Ambrosio P, Auletta V (2004) Deterministic monotone algorithms for scheduling on related machines. In: 2nd workshop on approximation and online algorithms (WAOA), Bergen, pp 267–280

    Google Scholar 

  2. Andelman N, Azar Y, Sorani M (2005) Truthful approximation mechanisms for scheduling selfish related machines. In: 22nd annual symposium on theoretical aspects of computer science (STACS), Stuttgart, pp 69–82

    Google Scholar 

  3. Archer A (2004) Mechanisms for discrete optimization with rational agents. PhD thesis, Cornell University

    Google Scholar 

  4. Archer A, Tardos É (2001) Truthful mechanisms for one-parameter agents. In: 42nd annual symposium on foundations of computer science (FOCS), Las Vegas, pp 482–491

    Google Scholar 

  5. Auletta V, De Prisco R, Penna P, Persiano G (2004) Deterministic truthful approximation mechanisms for scheduling related machines. In: 21nd annual symposium on theoretical aspects of computer science (STACS), Montpellier, pp 608–619

    Google Scholar 

  6. Auletta V, De Prisco R, Penna P, Persiano G, Ventre C (2006) New constructions of mechanisms with verification. In: 33rd international colloquium on automata, languages and programming (ICALP), Venice, (1), pp 596–607

    Google Scholar 

  7. Christodoulou G, Kovács A (2013) A deterministic truthful ptas for scheduling related machines. SIAM J Comput 42(4):1572–1595

    Article  MathSciNet  MATH  Google Scholar 

  8. Dhangwatnotai P, Dobzinski S, Dughmi S, Roughgarden T (2011) Truthful approximation schemes for single-parameter agents. SIAM J Comput 40(3):915–933

    Article  MathSciNet  MATH  Google Scholar 

  9. Garey MR, Johnson DS (1990) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York

    MATH  Google Scholar 

  10. Hochbaum D, Shmoys D (1988) A polynomial approximation scheme for scheduling on uniform processors: Usingthe dual approximation approach. SIAM J Comput 17(3):539–551

    Article  MathSciNet  MATH  Google Scholar 

  11. Kis T, Kapolnai R (2007) Approximations and auctions for scheduling batches on related machines. Oper Res Lett 35(1):61–68

    Article  MathSciNet  MATH  Google Scholar 

  12. Kovács A (2005) Fast monotone 3-approximation algorithm for scheduling related machines. In: 13th annual European symposium (ESA), Palma de Mallorca, Spain, pp 616–627

    Google Scholar 

  13. Kovács A (2007) Fast algorithms for two scheduling problems. PhD thesis, Universität des Saarlandes

    Google Scholar 

  14. Mu’alem A, Schapira M (2007) Setting lower bounds on truthfulness: extended abstract. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms (SODA ’07), New Orleans. Society for Industrial and Applied Mathematics, Philadelphia, pp 1143–1152. ISBN: 978-0-898716-24-5, http://dl.acm.org/citation.cfm?id=1283383.1283506

  15. Nisan N, Ronen A (2001) Algorithmic mechanism design. Games Econ Behav 35:166–196

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Moshe Babaioff .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Babaioff, M. (2016). Truthful Mechanisms for One-Parameter Agents. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_436

Download citation

Publish with us

Policies and ethics