Mechanism Design Under Approximate Incentive Compatibility

References

• Azevedo EM, Budish E (2018) Strategy-proofness in the large. Rev. Econom. Stud. 86(1):81–116.Google Scholar
• Balcan MF, Sandholm T, Vitercik E (2019) Estimating approximate incentive compatibility. Proc. ACM Conf. on Econom. and Comput. (Association for Computing Machinery, New York), 867.Google Scholar
• Balcan MF, Blum A, Hartline JD, Mansour Y (2005) Mechanism design via machine learning. Proc. 46th Annual IEEE Sympos. on Foundations of Comput. Sci. (IEEE, New York), 605–614.Google Scholar
• Balseiro SR, Besbes O, Weintraub GY (2015) Repeated auctions with budgets in ad exchanges: Approximations and design. Management Sci. 61(4):864–884.Link, Google Scholar
• Balseiro SR, Besbes O, Weintraub GY (2019) Dynamic mechanism design with budget-constrained buyers under limited commitment. Oper. Res. 67(3):711–730.Link, Google Scholar
• Basu A, Martin K, Ryan CT (2017) Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Programming 161(1-2):451–485.Crossref, Google Scholar
• Bei X, Huang Z (2011) Bayesian incentive compatibility via fractional assignments. Proc. 22nd Annual ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 720–733.Google Scholar
• Cai Y, Oikonomou A, Velegkas G, Zhao M (2021) An efficient ε-bic to bic transformation and its application to black-box reduction in revenue maximization. Proc. ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 1337–1356.Google Scholar
• Caroll G (2013) A quantitative approach to incentives: Application to voting rules. Working paper, University of Toronto, Toronto.Google Scholar
• Cole R, Roughgarden T (2014) The sample complexity of revenue maximization. Proc. 46th Annual ACM Sympos. on Theory of Comput. (Association for Computing Machinery, New York), 243–252.Google Scholar
• Colini-Baldeschi R, Leonardi S, Schrijvers O, Sodomka E (2020) Envy, Regret, and Social Welfare Loss. Proc. The World Wide Web Conf. (Association for Computing Machinery, New York), 2913–2919.Crossref, Google Scholar
• Conitzer V, Feng Z, Parkes DC, Sodomka E (2021) Welfare-preserving ε-bic to bic transformation with negligible revenue loss. Proc. Web and Internet Econom.: 17th Internat. Conf. (Springer-Verlag, Berlin), 76–94.Google Scholar
• Daskalakis C, Weinberg SM (2012) Symmetries and optimal multi-dimensional mechanism design. Proc. 13th ACM Conf. on Electronic Commerce (Association for Computing Machinery, New York), 370–387.Google Scholar
• Deng Y, Lahaie S (2019) Testing dynamic incentive compatibility in display ad auctions. Proc. 25th ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (ACM, New York), 4204–4221.Google Scholar
• Deng Y, Lahaie S, Mirrokni V, Zuo S (2020) A data driven metric of incentive compatibility. Proc. The World Wide Web Conf. (Association for Computing Machinery, New York).Google Scholar
• Driver RD (2012) Ordinary and Delay Differential Equations, vol. 20 (Springer Science & Business Media, New York).Google Scholar
• Dughmi S, Hartline J, Kleinberg RD, Niazadeh R (2021) Bernoulli factories and black-box reductions in mechanism design. J. ACM 68(2):1–30.Crossref, Google Scholar
• Dütting P, Roughgarden T, Talgam-Cohen I (2021) The complexity of contracts. SIAM J. Comput. 50(1):211–254.Crossref, Google Scholar
• El’sgol’ts LE, Norkin SB (1973) Introduction to the Theory and Application of Differential Equations with Deviating Arguments, vol. 105 (Academic Press, New York).Google Scholar
• Feng Z, Schrijvers O, Sodomka E (2019) Online learning for measuring incentive compatibility in ad auctions. Proc. The World Wide Web Conf. (Association for Computing Machinery, New York), 2729–2735.Google Scholar
• Gorokh A, Banerjee S, Iyer K (2021) From monetary to nonmonetary mechanism design via artificial currencies. Math. Oper. Res. 46(3):835–855.Link, Google Scholar
• Hartline JD, Lucier B (2010) Bayesian algorithmic mechanism design. Proc. 42nd ACM Sympos. on Theory of Comput. (ACM, New York), 301–310.Google Scholar
• Hartline JD, Lucier B (2015) Non-optimal mechanism design. Amer. Econom. Rev. 105(10):3102–3124.Crossref, Google Scholar
• Hartline JD, Kleinberg R, Malekian A (2011) Bayesian incentive compatibility via matchings. Proc. 22nd Annual ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 734–747.Google Scholar
• Hartline JD, Kleinberg R, Malekian A (2015) Bayesian incentive compatibility via matchings. Games Econom. Behav. 92:401–429.Crossref, Google Scholar
• Kanoria Y, Nazerzadeh H (2014) Dynamic reserve prices for repeated auctions: Learning from bids. Liu TY, Qi Q, Ye Y, eds. Web and Internet Economics (Springer International Publishing, Cham, Switzerland), 232–232.Crossref, Google Scholar
• Lahaie S, Medina AM, Sivan B, Vassilvitskii S (2018) Testing incentive compatibility in display ad auctions. Proc. World Wide Web Conf. (Association for Computing Machinery, New York), 1419–1428.Google Scholar
• Lubin B, Parkes D (2012) Approximate strategyproofness. Current Sci. 103(9):4204–4221.Google Scholar
• Manelli AM, Vincent DR (2007) Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly. J. Econom. Theory 137(1):153–185.Crossref, Google Scholar
• Martin K, Ryan CT, Stern M (2016) The slater conundrum: Duality and pricing in infinite-dimensional optimization. SIAM J. Optim. 26(1):111–138.Crossref, Google Scholar
• Milgrom P (2011) Critical issues in the practice of market design. Econom. Inquiry 49(2):311–320.Crossref, Google Scholar
• Milgrom P, Segal I (2002) Envelope theorems for arbitrary choice sets. Econometrica 70(2):583–601.Crossref, Google Scholar
• MoPub (2013) Introducing soft price floors. Accessed February 10, 2020, https://www.mopub.com/2013/04/12/introducing-soft-price-floors.Google Scholar
• Myerson RB (1979) Incentive compatibility and the bargaining problem. Econometrica 47(1):61–73.Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Nazerzadeh H, Saberi A, Vohra R (2013) Dynamic pay-per-action mechanisms and applications to online advertising. Oper. Res. 61(1):98–111.Link, Google Scholar
• Riley J, Zeckhauser R (1983) Optimal selling strategies: When to haggle, when to hold firm. Quart. J. Econom. 98(2):267–289.Crossref, Google Scholar
• Ross SM, Kelly JJ, Sullivan RJ, Perry WJ, Mercer D, Davis RM, Washburn TD, et al.. (1996) Stochastic Processes, vol. 2. (Wiley, New York).Google Scholar
• Rubinstein A, Weinberg SM (2015) Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. Proc. 16th ACM Conf. on Econom. and Comput. (Association for Computing Machinery, New York), 377–394.Google Scholar
• Zeithammer R (2019) Soft floors in auctions. Management Sci. 65(9):4204–4221.Link, Google Scholar