Distributionally Robust Mechanism Design

References

• Bandi C, Bertsimas D (2014) Optimal design for multi-item auctions: A robust optimization approach. Math. Oper. Res. 39(4):1012–1038.Link, Google Scholar
• Ben-Tal A, Ghaoui LE, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bergemann D, Morris S (2005) Robust mechanism design. Econometrica 73(6):1771–1813.Crossref, Google Scholar
• Bergemann D, Morris S (2013) An introduction to robust mechanism design. Found. Trends Microeconom. 8(3):169–230.Crossref, Google Scholar
• Bergemann D, Brooks BA, Morris S (2016) Informationally robust optimal auction design. Working paper, Yale University, New Haven, CT.Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bewley TF (2002) Knightian decision theory. Part I. Decisions Econom. Finance 25(2):79–110.Crossref, Google Scholar
• Bodoh-Creed AL (2012) Ambiguous beliefs and mechanism design. Games Econom. Behav. 75(2):518–537.Crossref, Google Scholar
• Bose S, Daripa A (2009) A dynamic mechanism and surplus extraction under ambiguity. J. Econom. Theory 144(5):2084–2114.Crossref, Google Scholar
• Bose S, Ozdenoren E, Pape A (2006) Optimal auctions with ambiguity. Theoret. Econom. 1(4):411–438.Google Scholar
• Bulow J, Klemperer P (1996) Auctions versus negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• Chen Y, Katuščák P, Ozdenoren E (2007) Sealed bid auctions with ambiguity: Theory and experiments. J. Econom. Theory 136(1):513–535.Crossref, Google Scholar
• Chiesa A, Micali S, Zhu ZA (2015) Knightian analysis of the Vickrey mechanism. Econometrica 83(5):1727–1754.Crossref, Google Scholar
• Chung KS, Ely JC (2007) Foundations of dominant-strategy mechanisms. Rev. Econom. Stud. 74(2):447–476.Crossref, Google Scholar
• Corless RM, Gonnet GH, Hare DE, Jeffrey DJ, Knuth DE (1996) On the Lambert W function. Adv. Comput. Math. 5(1):329–359.Crossref, Google Scholar
• Cremer J, McLean RP (1988) Full extraction of the surplus in Bayesian and dominant strategy auctions. Econometrica 56(6):1247–1257.Crossref, Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):596–612.Link, Google Scholar
• Delage E, Kuhn D, Wiesemann W (2016) “Dice”-sion making under uncertainty: When can a random decision reduce risk? Working paper, HEC, Montreal.Google Scholar
• Dhangwatnotai P, Roughgarden T, Yan Q (2015) Revenue maximization with a single sample. Games Econom. Behav. 91:318–333.Crossref, Google Scholar
• Fudenberg D, Tirole J (1991) Game Theory (MIT Press, Cambridge, MA).Google Scholar
• Goldberg AV, Hartline JD, Karlin AR, Saks M, Wright A (2006) Competitive auctions. Games Econom. Behav. 55(2):242–269.Crossref, 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.Link, Google Scholar
• Hartline JD, Roughgarden T (2008) Optimal mechanism design and money burning. Proc. 40th Annual ACM Sympos. Theory Comput. (ACM, New York), 75–84.Crossref, Google Scholar
• Iancu DA, Trichakis N (2013) Pareto efficiency in robust optimization. Management Sci. 60(1):130–147.Link, Google Scholar
• Klemperer P (1999) Auction theory: A guide to the literature. J. Econom. Surv. 13(3):227–286.Crossref, Google Scholar
• Knight FH (1921) Risk, Uncertainty and Profit (Hart, Schaffner and Marx, New York).Google Scholar
• Koçyiğit Ç, Bayrak HI, Pınar MÇ (2018) Robust auction design under multiple priors by linear and integer programming. Ann. Oper. Res. 260(1–2):233–253.Crossref, Google Scholar
• Krishna V (2009) Auction Theory, 2nd ed. (Academic Press, New York).Google Scholar
• Lo KC (1998) Sealed bid auctions with uncertainty averse bidders. Econom. Theory 12(1):1–20.Crossref, Google Scholar
• Lopomo G, Rigotti L, Shannon C (2014) Uncertainty in mechanism design. Working paper, Duke University, Durham, NC.Google Scholar
• McAfee RP, McMillan J (1987) Auctions with entry. Econom. Lett. 23(4):343–347.Crossref, Google Scholar
• Milgrom PR, Weber RJ (1982) A theory of auctions and competitive bidding. Econometrica 50(5):1089–1122.Crossref, Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic Game Theory, vol. 1 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ozdenoren E (2002) Auctions and bargaining with a set of priors. Working paper, London Business School, London.Google Scholar
• Riley JG, Samuelson WF (1981) Optimal auctions. Amer. Econom. Rev. 71(3):381–392.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.Crossref, Google Scholar
• Salo A, Weber M (1995) Ambiguity aversion in first-price sealed-bid auctions. J. Risk Uncertainty 11(2):123–137.Crossref, Google Scholar
• Shapiro A (2001) On duality theory of conic linear problems. Goberna MA, L’opez MA, eds. Semi-Infinite Programming (Kluwer Academic Publishers, Dordrecht, Netherlands), 135–165.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2014) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Crossref, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar