Bayesian incentive compatibility via matchings

Abrahamson, 2008, Optimal random matchings on trees and applications, vol. 5171, 254 Ahuja, 1993 Ajtai, 1984, On optimal matchings, Combinatorica, 4, 259, 10.1007/BF02579135 Armstrong, 1996, Multiproduct nonlinear pricing, Econometrica, 64, 51, 10.2307/2171924 Armstrong, 1999, Price discrimination by a many-product firm, Rev. Econ. Stud., 66, 151, 10.1111/1467-937X.00082 Assouad, 1983, Plongements Lipschitziens dans Rn, Bull. Soc. Math. France, 111, 429, 10.24033/bsmf.1997 Bei, 2011, Bayesian incentive compatibility via fractional assignments, 720 Briest, 2005, Approximation techniques for utilitarian mechanism design, 39 Cai, 2011, Extreme-value theorems for optimal multidimensional pricing, 522 Chawla, 2007, Algorithmic pricing via virtual valuations, 243 Chawla, 2010, Multi-parameter mechanism design and sequential posted pricing, 311 Chawla, 2010, The power of randomness in Bayesian optimal mechanism design, 149 Clarke, 1971, Multipart pricing of public goods, Public Choice, 11, 17, 10.1007/BF01726210 Daskalakis Dughmi, 2014, Black-box randomized reductions in algorithmic mechanism design, SIAM J. Computing, 43, 312, 10.1137/110843654 Groves, 1973, Incentives in teams, Econometrica, 41, 617, 10.2307/1914085 Gul, 1999, Walrasian equilibrium with gross substitutes, J. Econ. Theory, 87, 95, 10.1006/jeth.1999.2531 Haghpanah Hart, 2013, The menu-size complexity of auctions, 565 Hartline, 2010, Bayesian algorithmic mechanism design, 301 Hoeffding, 1963, Probability inequalities for sums of bounded random variables, J. Amer. Statistical Assoc., 58, 13, 10.1080/01621459.1963.10500830 Kantorovich, 1942, On the translocation of masses, C. R. (Doklady) Acad. Sci. URSS (N. S.), 37, 199 Karmarkar, 1984, A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373, 10.1007/BF02579150 Karp, 1984, A probabilistic analysis of multidimensional bin packing problems, 289 Khachiyan, 1979, A polynomial algorithm in linear programming, Soviet Math. Doklady, 20, 191 Kozlov, 1979, Polynomial solvability of convex quadratic programming, Soviet Math. Doklady, 20, 1108 Lavi, 2011, Truthful and near-optimal mechanism design via linear programming, J. ACM, 58, 25, 10.1145/2049697.2049699 Lehmann, 2002, Truth revelation in rapid, approximately efficient combinatorial auctions, J. ACM, 49, 577, 10.1145/585265.585266 Monge, 1781, Mémoire sur la théorie des déblais et des remblais, 666 Mu'Alem, 2009, On multi-dimensional envy-free mechanisms, 120 Myerson, 1981, Optimal auction design, Math. Operations Res., 6, 58, 10.1287/moor.6.1.58 Nisan, 2007, Computationally feasible VCG mechanisms, J. Artificial Intelligence Res. (JAIR), 29, 19, 10.1613/jair.2046 Rochet, 1987, A necessary and sufficient condition for rationalizability in a quasi-linear context, J. Math. Econ., 16, 191, 10.1016/0304-4068(87)90007-3 Spielman, 2004, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time, J. ACM, 51, 385, 10.1145/990308.990310 Talagrand, 1992, Matching random samples in many dimensions, Ann. Appl. Probability, 2, 846, 10.1214/aoap/1177005578 Talagrand, 1994, Matching theorems and empirical discrepancy computations using majorizing measures, J. Amer. Math. Soc., 7, 455, 10.1090/S0894-0347-1994-1227476-X Valiant, 1979, The complexity of computing the permanent, Theor. Comput. Sci., 8, 189, 10.1016/0304-3975(79)90044-6 Vickrey, 1961, Counterspeculation, auctions, and competitive sealed tenders, J. Finance, 16, 8, 10.1111/j.1540-6261.1961.tb02789.x Villani, 2003, Topics in Optimal Transportation, vol. 58