Mechanism Design for Online Resource Allocation

This paper concerns the mechanism design for online resource allocation in a strategic setting. In this setting, a single supplier allocates capacity-limited resources to requests that arrive in a ...

[1]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[2]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[3]  Niv Buchbinder,et al.  Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach , 2013, Algorithmica.

[4]  Joseph Naor,et al.  A Truthful Mechanism for Value-Based Scheduling in Cloud Computing , 2013, Theory of Computing Systems.

[5]  WiermanAdam,et al.  Competitive Online Optimization under Inventory Constraints , 2019 .

[6]  Ryan Porter,et al.  Mechanism design for online real-time scheduling , 2004, EC '04.

[7]  Noam Nisan,et al.  Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.

[8]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[9]  David Simchi-Levi,et al.  Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond , 2019, EC.

[10]  José R. Correa,et al.  Posted Price Mechanisms for a Random Stream of Customers , 2017, EC.

[11]  Yishay Mansour,et al.  Welfare and Profit Maximization with Production Costs , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[12]  Danny H. K. Tsang,et al.  Optimal Posted Prices for Online Resource Allocation with Supply Costs , 2019, PERV.

[13]  Maria-Florina Balcan,et al.  Item pricing for revenue maximization , 2008, EC '08.

[14]  Neel Sundaresan,et al.  Auctions versus Posted Prices in Online Markets , 2018, Journal of Political Economy.

[15]  Spyridon Antonakopoulos,et al.  Minimum-Cost Network Design with (Dis)economies of Scale , 2016, SIAM J. Comput..

[16]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[17]  Ran El-Yaniv,et al.  Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.

[18]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..

[19]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[20]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WWW.

[21]  David Porter,et al.  Combinatorial auction design , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[22]  LiZongpeng,et al.  Optimal Posted Prices for Online Cloud Resource Allocation , 2017 .

[23]  Joseph Naor,et al.  Improved bounds for online routing and packing via a primal-dual approach , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).