Polyhedral Clinching Auctions for Two-Sided Markets

References

• [1] Ausubel LM (2004) An efficient ascending-bid auction for multiple objects. Amer. Econom. Rev. 94(5):1452–1475.Crossref, Google Scholar
• [2] Bhattacharya S, Conitzer V, Munagala K, Xia L (2010) Incentive compatible budget elicitation in multi-unit auctions. Charikar M, ed. Proc. 21 Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 554–572.Google Scholar
• [3] Bikhchandani S, de Vries S, Schummer J, Vohra RV (2011) An ascending vickrey auction for selling bases of a matroid. Oper. Res. 59(2):400–413.Link, Google Scholar
• [4] Colini-Baldeschi R, de Keijzer B, Leonardi S, Turchetta S (2016) Approximately efficient double auctions with strong budget balance. Kraughgamer R, ed. Proc. 27 Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1424–1443.Google Scholar
• [5] Colini-Baldeschi R, Leonardi S, Henzinger M, Starnberger M (2015) On multiple keyword sponsored search auctions with budgets. ACM Trans. Econom. Comput. 4(1):2:1–2:34.Google Scholar
• [6] Dobzinski S, Paes Leme R (2014) Efficiency guarantees in auctions with budgets. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, eds. Proc. 41 st Internat. Colloquium Automata Languages Programming, Lecture Notes in Computer Science, vol. 8572 (Springer-Verlag, Berlin), 392–404.Google Scholar
• [7] Dobzinski S, Lavi R, Nisan N (2012) Multi-unit auctions with budget limits. Games Econom. Behav. 74(2):486–503.Crossref, Google Scholar
• [8] Dütting P, Henzinger M, Starnberger M (2015) Auctions for heterogeneous items and budget limits. ACM Trans. Econom. Comput. 4(1):4:1–4:17.Google Scholar
• [9] Dütting P, Roughgarden T, Talgam-Cohen I (2017) Modularity and greed in double auctions. Games Econom. Behav. 105:59–83.Google Scholar
• [10] Fiat A, Leonardi S, Saia J, Sankowski P (2011) Single valued combinatorial auctions with budgets. Chen Y, Roughgarden T, Shoham Y, eds. Proc. 12th ACM Conf. Electronic Commerce (ACM, New York), 223–232.Google Scholar
• [11] Freeman R, Pennock DM, Wortman Vaughan J (2017) The double clinching auction for wagering. Babaioff M, Moulin H, Daskalakis C, eds. Proc. 2017 ACM Conf. Econom. Comput. (ACM, New York), 43–60.Google Scholar
• [12] Fujishige S (2005) Submodular Functions and Optimization, 2nd ed. (Elsevier, Amsterdam).Google Scholar
• [13] Goel G, Mirrokni V, Paes Leme R (2014) Clinching auctions beyond hard budget constraints. Conitzer V, Easley D, Babaioff M, eds. Proc. 15th ACM Conf. Econom. Comput. (ACM, New York), 167–184.Google Scholar
• [14] Goel G, Mirrokni V, Paes Leme R (2015) Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3):18:1–18:27.Crossref, Google Scholar
• [15] Goel G, Mirrokni V, Paes Leme R (2020) Clinching auctions with online supply. Games. Econom. Behav. 123:342–358.Google Scholar
• [16] Goel G, Leonardi S, Mirrokni V, Nikzad A, Paes Leme R (2016) Reservation exchange markets for internet advertising. Chatzigiannakis I, Mitzenmacher M, Rabani Y, Sangiorgi D, eds. Proc. 43rd Internat. Colloquium Automata Languages Programming Leibniz Internat. Proc. Informatics, vol. 55 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 142:1–142:13.Google Scholar
• [17] Grigorieva E, Herings PJJ, Müller R, Vermeulen D (2007) The private value single item bisection auction. Econom. Theory 30(1):107–118.Crossref, Google Scholar
• [18] Hafalir IE, Ravi R, Sayedi A (2009) Sort-cut: A Pareto optimal and semi-truthful mechanism for multi-unit auctions with budget-constrained bidders. Working paper, Carnegie Mellon University, Tepper School of Business, Pittsburgh.Google Scholar
• [19] Hafalir IE, Ravi R, Sayedi A (2012) A near Pareto optimal auction with budget constraints. Games Econom. Behav. 74(2):699–708.Crossref, Google Scholar
• [20] Lawler EL, Martel CU (1982) Computing maximal “polymatroidal” network flows. Math. Oper. Res. 7(3):334–347.Link, Google Scholar
• [21] McAfee R (1992) A dominant strategy double auction. J. Econom. Theory 56(2):434–450.Crossref, Google Scholar
• [22] McDiarmid CJH (1975) Rado’s theorem for polymatroids. Math. Proc. Cambridge Philosophical Soc. 78(2):263–281.Crossref, Google Scholar
• [23] Myerson RB, Satterthwaite MA (1983) Efficient mechanisms for bilateral trading. J. Econom. Theory 29(2):265–281.Crossref, Google Scholar
• [24] Obara M (2019) Fair revenue sharing on polyhedral clinching auction for two-sided markets. Bachelor’s thesis, University of Tokyo, Tokyo.Google Scholar
• [25] Schrijver A (2003) Combinatorial Optimization (Springer-Verlag, Berlin).Google Scholar
• [26] Segal-Halevi E, Hassidim A, Aumann Y (2018) Double auctions in markets for multiple kinds of goods. Lang J, ed. Proc. 27th Internat. Joint Conf. Artificial Intelligence (IJCAI, Stockholm), 489–497.Google Scholar
• [27] Segal-Halevi E, Hassidim A, Aumann Y (2018) MUDA: A truthful multi-unit double-auction mechanism. Proc. 32nd AAAI Conf. Artificial Intelligence (AAAI, Menlo Park), 1193–1201.Google Scholar
• [28] Wu W, Liu X, Li M (2018) Budget-feasible procurement mechanisms in two-sided markets. Lang J, ed. Proc. 27th Internat. Joint Conf. Artificial Intelligence (IJCAI, Stockholm), 489–497.Google Scholar