New Constructions of Obviously Strategyproof Mechanisms

References

• [1] Adamczyk M, Borodin A, Ferraioli D, de Keijzer B, Leonardi S (2017) Sequential posted price mechanisms with correlated valuations. ACM Trans. Econom. Comput. 5(4):1–39.Crossref, Google Scholar
• [2] Archer A, Tardos É (2001) Truthful mechanisms for one-parameter agents. FOCS 2001, 482–491.Google Scholar
• [3] Arribillaga RP, Massó J, Neme A (2019) All sequential allotment rules are obviously strategy-proof. Working paper, Departament d’Economia i d’Historia Economica, Barcelona, Spain.Google Scholar
• [4] Arribillaga RP, Massó J, Neme A (2020) On obvious strategy-proofness and single-peakedness. J. Econom. Theory. 186:104992.Crossref, Google Scholar
• [5] Ashlagi I, Gonczarowski YA (2018) Stable matching mechanisms are not obviously strategy-proof. J. Econom. Theory 177:405–425.Crossref, Google Scholar
• [6] Ausubel LM (2004) An efficient ascending-bid auction for multiple objects. Amer. Econom. Rev. 94(5):1452–1475.Crossref, Google Scholar
• [7] Babaioff M, Immorlica N, Lucier B, Weinberg SM (2014) A simple and approximately optimal mechanism for an additive buyer. FOCS 2014, 21–30.Google Scholar
• [8] Bade S, Gonczarowski YA (2017) Gibbard-Satterthwaite success stories and obvious strategyproofness. EC 2017, 565.Google Scholar
• [9] Bikhchandani S, Chatterji S, Lavi R, Muálem A, Nisan N, Sen A (2006) Weak monotonicity characterizes deterministic dominant-strategy implementation. Econometrica 74(4):1109–1132.Crossref, Google Scholar
• [10] Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• [11] Chawla S, Hartline J, Malec D, Sivan B (2010) Multi-parameter mechanism design and sequential posted pricing. STOC 2010, 311–320.Google Scholar
• [12] Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2017) Posted price mechanisms for a random stream of customers. EC 2017, 169–186.Google Scholar
• [13] de Keijzer B, Kyropoulou M, Ventre C (2020) Obviously strategyproof single-minded combinatorial auctions. ICALP 2020, 71:1–71:17.Google Scholar
• [14] Dütting P, Gkatzelis V, Roughgarden T (2017) The performance of deferred-acceptance auctions. Math. Oper. Res. 42(4), 897–1312.Link, Google Scholar
• [15] Eden A, Feldman M, Friedler O, Talgam-Cohen I, Weinberg SM (2017a) The competition complexity of auctions: A Bulow-Klemperer result for multi-dimensional bidders. EC 2017, 343–343.Google Scholar
• [16] Eden A, Feldman M, Friedler O, Talgam-Cohen I, Weinberg SM (2017b) A simple and approximately optimal mechanism for a buyer with complements. EC 2017, 323–323.Google Scholar
• [17] Feldman M, Fiat A, Roytman A (2017) Makespan minimization via posted prices. EC 2017, 405–422.Google Scholar
• [18] Ferraioli D, Meier A, Penna P, Ventre C (2019a) Automated optimal OSP mechanisms for set systems: The case of small domains. WINE 2019, 171–185.Google Scholar
• [19] Ferraioli D, Meier A, Penna P, Ventre C (2019b) Obviously strategyproof mechanisms for machine scheduling. ESA 2019.Google Scholar
• [20] Ferraioli D, Penna P, Ventre C (2021) Two-way greedy: Algorithms for imperfect rationality. WINE 2021, 3–21.Google Scholar
• [21] Ferraioli D, Ventre C (2017) Obvious strategyproofness needs monitoring for good approximations. AAAI 2017, 516–522.Google Scholar
• [22] Ferraioli D, Ventre C (2018) Probabilistic verification for obviously strategyproof mechanisms. IJCAI 2018, 240–246.Google Scholar
• [23] Ferraioli D, Ventre C (2019) Obvious strategyproofness, bounded rationality and approximation: The case of machine scheduling. SAGT 2019.Google Scholar
• [24] Gkatzelis V, Markakis E, Roughgarden T (2017) Deferred-acceptance auctions for multiple levels of service. EC 2017, 21–38.Google Scholar
• [25] Glazer J, Rubinstein A (1996) An extensive game as a guide for solving a normal game. J. Econom. Theory. 70:32–42.Crossref, Google Scholar
• [26] Gui H, Müller R, Vohra RV (2004) Dominant strategy mechanisms with multidimensional types. Discussion paper 1392, Northwestern University, Evanston, IL.Google Scholar
• [27] Hartline J, Roughgarden T (2009) Simple vs. optimal mechanisms. EC 2009, 225–234.Google Scholar
• [28] Kagel J, Harstad R, Levin D (1987) Information impact and allocation rules in auctions with affiliated private values: A laboratory study. Econometrica 55(6):1275–1304.Crossref, Google Scholar
• [29] Kim A (2015) Welfare maximization with deferred acceptance auctions in reallocation problems. ESA 2015, 804–815.Google Scholar
• [30] Krysta P, Ventre C (2015) Combinatorial auctions with verification are tractable. Theoret. Comput. Sci. 571:21–35.Crossref, Google Scholar
• [31] Kyropoulou M, Ventre C (2019) Obviously strategyproof mechanisms without money for scheduling. AAMAS 2019.Google Scholar
• [32] Lavi R, Swamy C (2009) Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. Games Econom. Behav. 67(1):99–124.Crossref, Google Scholar
• [33] Li S (2017) Obviously strategy-proof mechanisms. Amer. Econom. Rev. 107(11):3257–3287.Crossref, Google Scholar
• [34] Mackenzie A (2017) A revelation principle for obviously strategy-proof implementation. Research Memorandum 014, (GSBE).Google Scholar
• [35] Malakhov A, Vohra RV (2004) Single and multi-dimensional optimal auctions—A network approach. Discussion paper 1397, Northwestern University, Evanston, IL.Google Scholar
• [36] Milgrom P, Segal I (2014) Deferred-acceptance auctions and radio spectrum reallocation. EC 2014.Google Scholar
• [37] Nisan N, Ronen A (2001) Algorithmic Mechanism Design. Games Econom. Behav. 35:166–196.Crossref, Google Scholar
• [38] Penna P, Ventre C (2014) Optimal collusion-resistant mechanisms with verification. Games Econom. Behav. 86:491–509.Crossref, Google Scholar
• [39] Pycia M, Troyan P (2019) Obvious dominance and random priority. EC 2019.Google Scholar
• [40] Rochet JC (1985) The taxation principle and multitime Hamilton-Jacobi equations. J. Math. Econom. 14(2):113–128.Crossref, Google Scholar
• [41] Saks M, Yu L (2005) Weak monotonicity suffices for truthfulness on convex domains. EC 2005, 286–293.Google Scholar
• [42] Sandholm T, Gilpin A (2003) Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation. AMEC 2003, 73–91.Google Scholar
• [43] Troyan P (2019) Obviously strategy-proof implementation of top trading cycles. Internat. Econom. Rev. 60(3):1249–1261.Crossref, Google Scholar
• [44] Ventre C (2014) Truthful optimization using mechanisms with verification. Theoret. Comput. Sci. 518:64–79.Crossref, Google Scholar
• [45] Zhang L, Levin D (2017) Bounded rationality and robust mechanism design: An axiomatic approach. Amer. Econom. Rev. 107(5):235–239.Crossref, Google Scholar