Mechanism Design for Correlated Valuations: Efficient Methods for Revenue Maximization

References

• Aghassi M, Bertsimas D (2006) Robust game theory. Math. Programming 107(1):231–273.Google Scholar
• Albert M, Conitzer V, Lopomo G (2015) Assessing the robustness of Cremer-McLean with automated mechanism design. Proc. 29th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 763–769.Google Scholar
• Albert M, Conitzer V, Lopomo G (2016) Maximizing revenue with limited correlation: The cost of ex-post incentive compatibility. Proc. 30th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 376–382.Google Scholar
• Albert M, Conitzer V, Stone P (2017a) Automated design of robust mechanisms. Proc. 31st AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 298–304.Google Scholar
• Albert M, Conitzer V, Stone P (2017b) Mechanism design with unknown correlated distributions: Can we learn optimal mechanisms? Proc. 16th Conf on Autonomous Agents and MultiAgent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 69–77.Google Scholar
• Bergemann D, Morris S (2005) Robust mechanism design. Econometrica 73(6):1771–1813.Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Google Scholar
• Blum A, Mansour Y, Morgenstern J (2015) Learning valuation distributions from partial observation. Proc. 29th AAAI Conf/ on Artificial Intelligence (AAAI Press, Palo Alto, CA), 798–805Google Scholar
• Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• Conitzer V, Sandholm T (2002) Complexity of mechanism design. Proc. 18th Annu. Conf. on Uncertainty in Artificial Intelligence, (Morgan Kaufmann, Alberta, Canada), 103–110.Google Scholar
• Conitzer V, Sandholm T (2004) Self-interested automated mechanism design and implications for optimal combinatorial auctions. Proc. 5th ACM Conf. Electronic Commerce (ACM, New York), 132–141.Google Scholar
• Cremer J, McLean RP (1985) Optimal selling strategies under uncertainty for a discriminating monopolist when demands are interdependent. Econometrica 53(2):345–361.Google Scholar
• Cremer J, McLean RP (1988) Full extraction of the surplus in Bayesian and dominant strategy auctions. Econometrica 56(6):1247–1257.Google Scholar
• Devroye L (1983) The equivalence of weak, strong and complete convergence in L1 for kernel density estimates. Ann. Statist. 11(3):896–904.Google Scholar
• FCC (2017) Broadcast incentive auction and post-auction transition. Accessed January 5, 2018, https://www.fcc.gov/about-fcc/fcc-initiatives/incentive-auctions.Google Scholar
• Fu H, Haghpanah N, Hartline J, Kleinberg R (2014) Optimal auctions for correlated buyers with sampling. Proc. 15th ACM Conf. Econom. Comput. (ACM, New York), 23–36.Google Scholar
• Gibbons R (1992) Game Theory for Applied Economists (Princeton University Press, Princeton, NJ).Google Scholar
• Government Accountability Office (2013) Reverse auctions: Guidance is needed to maximize competition and achieve cost savings. Technical report, Government Accountability Office, Washington, DC.Google Scholar
• Guo M, Conitzer V (2010) Computationally feasible automated mechanism design: General approach and case studies. Proc. 20th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 1676–1679.Google Scholar
• Harsanyi JC (1967) Games with incomplete information played by “Bayesian” players, i-iii: Part i. The basic model. Management Sci. 14(3):159–182.Google Scholar
• Hartline JD (2014) Mechanism design and approximation. Accessed, http://jasonhartline.com/MDnA/, http://jasonhartline.com/MDnA/.Google Scholar
• Hartline JD, Roughgarden T (2009) Simple vs. optimal mechanisms. Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 225–234.Google Scholar
• Interactive Advertising Bureau (2017) IAB programmatic revenue report 2016 results. Accessed January 5, 2018, https://www.iab.com/wp-content/uploads/2016/04/IAB_Internet_Advertising_Revenue_Report_FY_2016.pdf.Google Scholar
• Kanoria Y, Nazerzadeh H (2014) Dynamic reserve prices for repeated auctions: Learning from bids. Working paper, Columbia University, New York.Google Scholar
• Kosenok G, Severinov S (2008) Individually rational, budget-balanced mechanisms and allocation of surplus. J. Econom. Theory 140(1):126–161.Google Scholar
• Kozlov M, Tarasov S, Khachiyan L (1980) The polynomial solvability of convex quadratic programming. USSR Comput. Math. Math. Phys. 20(5):223–228.Google Scholar
• Lopomo G (2001) Optimality and robustness of the English auction. Games Econom. Behav. 36(2):219–240.Google Scholar
• Lopomo G, Rigotti L, Shannon C (2009) Uncertainty in mechanism design. Working paper, Duke University, Durham, NC.Google Scholar
• Martin DH (1975) On the continuity of the maximum in parametric linear programming. J. Optim. Theory Appl. 17(3):205–210.Google Scholar
• McAfee RP, Reny PJ (1992) Correlated information and mechanism design. Econometrica 60(2):395–421.Google Scholar
• Mitzenmacher M, Upfal E (2005) Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Mohri M, Medina AM, Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger K, eds. (2014) Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers. Advances in Neural Information Processing Systems, vol. 27 (Curran Associates, Red Hook, NY), 1871–1879.Google Scholar
• Mohri M, Medina AM (2016) Learning algorithms for second-price auctions with reserve. J. Machine Learning Res. 17(1):2632–2656.Google Scholar
• Morgenstern JH, Roughgarden T (2015) On the pseudo-dimension of nearly optimal auctions advances in neural information processing systems. NeurIPS 28:136–144.Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Google Scholar
• Myerson RB, Satterthwaite MA (1983) Efficient mechanisms for bilateral trading. J. Econom. Theory 29(2):265–281.Google Scholar
• NASA (2014) NASA chooses American companies to transport U.S. astronauts to international space station. Accessed January 5, 2018, https://www.nasa.gov/.Google Scholar
• Pardoe D, Stone P, Saar-Tsechansky M, Keskin T, Tomak K (2010) Adaptive auction mechanism design and the incorporation of prior knowledge. INFORMS J. Comput. 22(3):353–370.Link, Google Scholar
• Roughgarden T, Talgam-Cohen I (2013) Optimal and near-optimal mechanism design with interdependent values. Proc. 14th ACM Conf. Electronic Commerce (ACM, New York), 767–784.Google Scholar
• Sandholm T, Likhodedov A (2015) Automated design of revenue-maximizing combinatorial auctions. Oper. Res. 63(5):1000–1025.Google Scholar