Document Open Access Logo

Obviously Strategyproof Mechanisms for Machine Scheduling

Authors Diodato Ferraioli , Adrian Meier, Paolo Penna, Carmine Ventre

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2019.46.pdf
  • Filesize: 0.51 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Algorithmic mechanism design
Keywords
  • Bounded Rationality
  • Extensive-form Mechanisms
  • Approximate Mechanism Design

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Catering to the incentives of people with limited rationality is a challenging research direction that requires novel paradigms to design mechanisms and approximation algorithms. Obviously strategyproof (OSP) mechanisms have recently emerged as the concept of interest to this research agenda. However, the majority of the literature in the area has either highlighted the shortcomings of OSP or focused on the "right" definition rather than on the construction of these mechanisms. 
We here give the first set of tight results on the approximation guarantee of OSP mechanisms for scheduling related machines. By extending the well-known cycle monotonicity technique, we are able to concentrate on the algorithmic component of OSP mechanisms and provide some novel paradigms for their design.

Cite As Get BibTex

Diodato Ferraioli, Adrian Meier, Paolo Penna, and Carmine Ventre. Obviously Strategyproof Mechanisms for Machine Scheduling. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 46:1-46:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.ESA.2019.46

Author Details

Diodato Ferraioli
  • Università degli Studi di Salerno, Italy
Adrian Meier
  • ETH Zurich, Switzerland
Paolo Penna
  • ETH Zurich, Switzerland
Carmine Ventre
  • King’s College London, UK

Funding

  • Ferraioli, Diodato: This author is partially supported by GNCS-INdAM and by the Italian MIUR PRIN 2017 Project ALGADIMAR "Algorithms, Games, and Digital Markets".

References

  1. M. Adamczyk, A. Borodin, D. Ferraioli, B. de Keijzer, and S. Leonardi. Sequential Posted Price Mechanisms with Correlated Valuations. In WINE 2015, pages 1-15, 2015. Google Scholar
  2. I. Ashlagi and Y. A. Gonczarowski. Stable Matching Mechanisms are not Obviously Strategy-proof. J. Economic Theory, 177:405-425, 2018. Google Scholar
  3. L. M Ausubel. An Efficient Ascending-bid Auction for Multiple Objects. American Economic Review, 94(5):1452-1475, 2004. Google Scholar
  4. M. Babaioff, N. Immorlica, B. Lucier, and S M. Weinberg. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In FOCS 2014, pages 21-30, 2014. Google Scholar
  5. S. Bade and Y. A. Gonczarowski. Gibbard-Satterthwaite success stories and obvious strategyproofness. In EC 2017, page 565, 2017. Google Scholar
  6. S. Bikhchandani, S. Chatterji, R. Lavi, A. Muálem, N. Nisan, and A. Sen. Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation. Econometrica, 74(4):1109-1132, 2006. Google Scholar
  7. S. Chawla, J. Hartline, D. Malec, and B. Sivan. Multi-parameter Mechanism Design and Sequential Posted Pricing. In STOC 2010, pages 311-320, 2010. Google Scholar
  8. J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld. Posted Price Mechanisms for a Random Stream of Customers. In EC 2017, pages 169-186, 2017. Google Scholar
  9. P. Dütting, V. Gkatzelis, and T. Roughgarden. The Performance of Deferred-Acceptance Auctions. Math. Oper. Res., 42(4), 2017. Google Scholar
  10. A. Eden, M. Feldman, O. Friedler, I. Talgam-Cohen, and S. M. Weinberg. A Simple and Approximately Optimal Mechanism for a Buyer with Complements. In EC 2017, pages 323-323, 2017. Google Scholar
  11. M. Feldman, A. Fiat, and A. Roytman. Makespan Minimization via Posted Prices. In EC 2017, pages 405-422, 2017. Google Scholar
  12. D. Ferraioli and C. Ventre. Obvious Strategyproofness Needs Monitoring for Good Approximations. In AAAI 2017, pages 516-522, 2017. Google Scholar
  13. D. Ferraioli and C. Ventre. Probabilistic Verification for Obviously Strategyproof Mechanisms. In IJCAI 2018, 2018. Google Scholar
  14. D. Ferraioli and C. Ventre. Obvious Strategyproofness, Bounded Rationality and Approximation: The Case of Machine Scheduling. In SAGT 2019, 2019. Google Scholar
  15. V. Gkatzelis, E. Markakis, and T. Roughgarden. Deferred-acceptance auctions for multiple levels of service. In EC 2017, pages 21-38, 2017. Google Scholar
  16. H. Gui, R. Müller, and R. V. Vohra. Dominant Strategy Mechanisms with Multidimensional Types. Discussion paper 1392, Northwestern Univ., 2004. Google Scholar
  17. J. Hartline and T. Roughgarden. Simple versus Optimal Mechanisms. In EC 2009, pages 225-234, 2009. Google Scholar
  18. J. Kagel, R. Harstad, and D. Levin. Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study. Econometrica, pages 1275-1304, 1987. Google Scholar
  19. A. Kim. Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems. In ESA 2015, pages 804-815, 2015. Google Scholar
  20. P. Krysta and C. Ventre. Combinatorial Auctions with Verification are Tractable. Theor. Comput. Sci., 571:21-35, 2015. Google Scholar
  21. M. Kyropoulou and C. Ventre. Obviously Strategyproof Mechanisms without Money for Scheduling. In AAMAS 2019, 2019. Google Scholar
  22. R. Lavi and C. Swamy. Truthful Mechanism Design for Multi-dimensional Scheduling via Cycle Monotonicity. Games and Economic Behavior, 67(1):99-124, 2009. Google Scholar
  23. S. Li. Obviously Strategy-proof Mechanisms. American Economic Review, 107(11):3257-87, 2017. Google Scholar
  24. A. Mackenzie. A Revelation Principle for Obviously Strategy-proof Implementation. Research Memorandum 014, (GSBE), 2017. Google Scholar
  25. A. Malakhov and R. V. Vohra. Single and Multi-Dimensional Optimal Auctions - A Network Approach. Discussion paper 1397, Northwestern Univ., 2004. Google Scholar
  26. P. Milgrom and I. Segal. Deferred-acceptance Auctions and Radio Spectrum Reallocation. In EC 2014, 2014. Google Scholar
  27. M. Pycia and P. Troyan. Obvious Dominance and Random Priority. In EC 2019, 2019. Google Scholar
  28. J.-C. Rochet. The Taxation Principle and Multitime Hamilton-Jacobi Equations. Journal of Mathematical Economics, 14(2):113-128, 1985. Google Scholar
  29. M. Saks and L. Yu. Weak Monotonicity Suffices for Truthfulness on Convex Domains. In EC 2005, pages 286-293, 2005. Google Scholar
  30. C. Ventre. Truthful Optimization Using Mechanisms with Verification. Theor. Comput. Sci., 518:64-79, 2014. Google Scholar
  31. L. Zhang and D. Levin. Bounded rationality and robust mechanism design: An axiomatic approach. American Economic Review, 107(5):235-39, 2017. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact