Designing Core-Selecting Payment Rules: A Computational Search Approach

References

• Agarwal A, Dahleh M, Sarkar T (2019) A marketplace for data: An algorithmic solution. Karlin A, Immorlica N, Johari R, eds. Proc. 20th ACM Conf. Econom. Comput. (ACM, New York), 701–726.Google Scholar
• Ausubel LM, Baranov O (2017) A practical guide to the combinatorial clock auction. Econom. J. (Lond.) 127(605):F334–F350.Crossref, Google Scholar
• Ausubel LM, Baranov O (2020a) Core-selecting auctions with incomplete information. Internat. J. Game Theory 49(1):251–273.Crossref, Google Scholar
• Ausubel LM, Baranov O (2020b) VCG, the core, and assignment stages in auctions. Working paper, University of Maryland, College Park, MD.Google Scholar
• Ausubel LM, Cramton P (2011) Auction design for wind rights. Report to Bureau of Ocean Energy Management, Regulation and Enforcement, U.S. Department of the Interior, Washington, DC.Google Scholar
• Ausubel L, Milgrom P (2002) Ascending auctions with package bidding. BE J. Theoret. Econom. 1(1):1–42.Google Scholar
• Ausubel LM, Milgrom P (2006) The lovely but lonely Vickrey auction. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 17–40.Google Scholar
• Ausubel L, Cramton P, Milgrom P (2006) The clock-proxy auction: A practical combinatorial auction design. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 115–138.Google Scholar
• Balcan M-F, Sandholm T, Vitercik E (2019) Estimating approximate incentive compatibility. Karlin A, Immorlica N, Johari R, eds. Proc. 20th ACM Conf. Econom. Comput. (ACM, New York), 867.Google Scholar
• Balseiro S, Kim A, Mahdian M, Mirrokni V (2021) Budget-management strategies in repeated auctions. Oper. Res. 69(3):859–876.Link, Google Scholar
• Beck M, Ott M (2013) Incentives for overbidding in minimum-revenue core-selecting auctions. Proc. Annual Meeting Assoc. Soc. Policy (Deutsche Zentralbibliothek Leibniz-Informationszentrum für Wirtschaft, Duesseldorf, Germany).Google Scholar
• Bosshard V, Seuken S (2021a) The cost of simple bidding in combinatorial auctions. Biro P, Chawla S, Echenique F, eds. Proc. 22nd ACM Conf. Econom. Comput. (ACM, New York), 157.Google Scholar
• Bosshard V, Seuken S (2021b) Shapley-based core-selecting payment rules. Preprint, submitted July 2, https://arxiv.org/abs/2107.01048.Google Scholar
• Bosshard V, Bünz B, Lubin B, Seuken S (2017) Computing Bayes-Nash equilibria in combinatorial auctions with continuous value and action spaces. Sierra C, ed. Proc. 26th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 119–127.Google Scholar
• Bosshard V, Bünz B, Lubin B, Seuken S (2020) Computing Bayes-Nash equilibria in combinatorial auctions with verification. J. Artificial Intelligence Res. 69:531–570.Crossref, Google Scholar
• Bünz B, Lubin B, Seuken S (2018) Designing core-selecting payment rules: A computational search approach. Tardos E, Elkind E, Vohra R, eds. Proc. 19th ACM Conf. Econom. Comput. (ACM, New York), 109–110.Google Scholar
• Clarke E (1971) Multipart pricing of public goods. Public Choice 11(1):17–33.Crossref, Google Scholar
• Cramton P (2013) Spectrum auction design. Rev. Indust. Organ. 42(2):161–190.Crossref, Google Scholar
• Cramton P, Shoham Y, Steinberg R, eds. (2006) Combinatorial Auctions (MIT Press, Cambridge, MA).Google Scholar
• Day RW, Cramton P (2012) Quadratic core-selecting payment rules for combinatorial auctions. Oper. Res. 60(3):588–603.Link, Google Scholar
• Day RW, Milgrom P (2008) Core-selecting package auctions. Internat. J. Game Theory 36(3):393–407.Crossref, Google Scholar
• Day R, Milgrom P (2013) Optimal incentives in core-selecting auctions. Neeman Z, Roth A, Vulkan N, eds. Handbook of Market Design (Oxford University Press, Oxford, UK), 282–298.Crossref, Google Scholar
• Day RW, Raghavan S (2007) Fair payments for efficient allocations in public sector combinatorial auctions. Management Sci. 53(9):1389–1406.Link, Google Scholar
• Deng Y, Lahaie S (2019) Testing dynamic incentive compatibility in display ad auctions. Teredesai A, Kumar V, Li Y, Rosales R, Terzi E, Karypis G, eds. Proc. 25th ACM SIGKDD Conf. Knowledge Discovery Data Mining (ACM, New York), 1616–1624.Google Scholar
• Deng X, Papadimitriou CH (1994) On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2):257–266.Link, Google Scholar
• Erdil A, Klemperer P (2010) A new payment rule for core-selecting package auctions. J. Eur. Econom. Assoc. 8(2–3):537–547.Crossref, Google Scholar
• Goeree J, Lien Y (2016) On the impossibility of core-selecting auctions. Theoret. Econom. 11(1):41–52.Crossref, Google Scholar
• Government of Canada (2019) Mathematical formulations for winner and price determination for the combinatorial clock auction in the 600 MHz band. Accessed January 17, 2021, https://www.ic.gc.ca/eic/site/smt-gst.nsf/eng/sf11449.html.Google Scholar
• Groves T (1973) Incentives in teams. Econometrica 41(4):617–631.Crossref, Google Scholar
• Klemperer P (2010) The product-mix auction: A new auction design for differentiated goods. J. Eur. Econom. Assoc. 8(2–3):526–536.Crossref, Google Scholar
• Lubin B, Parkes D (2009) Quantifying the strategyproofness of mechanisms via metrics on payoff distributions. McAllester D, ed. Proc. 25th Conf. Uncertainty Artificial Intelligence (AUAI Press, Arlington, VA), 349–358.Google Scholar
• Lubin B, Parkes DC (2012) Approximate strategyproofness. Current Sci. 103(9):1021–1032.Google Scholar
• Lubin B, Bünz B, Seuken S (2015) New core-selecting payment rules with better fairness and incentive properties. Kominers S, Xia L, eds. Proc. 3rd Conf. Auctions, Market Mechanisms Appl. (ACM, New York).Google Scholar
• Marszalec D (2018) Fear not the simplicity—An experimental analysis of auctions for complements. J. Econom. Behav. Organ. 152(August):81–97.Crossref, Google Scholar
• Milgrom P (2007) Package auctions and exchanges. Econometrica 75(4):935–965.Crossref, Google Scholar
• Newman N, Leyton-Brown K, Milgrom P, Segal I (2020) Incentive auction design alternatives: A simulation study. Biro P, Hartline J, Ostrovsky M, eds. Proc. 21st ACM Conf. Econom. Comput. (ACM, New York), 603–604.Google Scholar
• Niazadeh R, Hartline J, Immorlica N, Khani MR, Lucier B (2021) Fast core pricing for rich advertising auctions. Oper. Res. 70(1):223–240.Google Scholar
• Parkes DC (2001) Iterative combinatorial auctions: Achieving economic and computational efficiency. PhD thesis, University of Pennsylvania, Philadelphia.Google Scholar
• Parkes D (2002) On indirect and direct implementations of core outcomes in combinatorial auctions. Technical report, Harvard University, Cambridge, MA.Google Scholar
• Parkes DC, Kalagnanam J, Eso M (2001) Achieving budget-balance with Vickrey-based payment schemes in exchanges. Proc. 17th Internat. Joint Conf. Artificial Intelligence, Vol. 2 (Morgan Kaufmann Publishers, San Francisco), 1161–1168.Google Scholar
• Sandholm T (2003) Automated mechanism design: A new application area for search algorithms. Rossi F, ed. Proc. Internat. Conf. Principles Practice Constraint Programming (Springer, Berlin), 19–36.Google Scholar
• Sandholm T (2013) Very-large-scale generalized combinatorial multi-attribute auctions: Lessons from conducting $60 billion of sourcing. Vulkan N, Roth AE, Neeman Z, eds. The Handbook of Market Design (Oxford University Press, Oxford, UK), 379–412.Crossref, Google Scholar
• Sklar M (1959) Fonctions de répartition à n dimensions et leurs marges. Publ. Inst. Statist. Univ. Paris 8:229–231.Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Crossref, Google Scholar