Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Gravin N and Wang H. Prophet Inequality for Bipartite Matching. Proceedings of the 2019 ACM Conference on Economics and Computation. (93-109).

    https://doi.org/10.1145/3328526.3329604

  • Ashlagi I, Burq M, Dutta C, Jaillet P, Saberi A and Sholley C. Edge Weighted Online Windowed Matching. Proceedings of the 2019 ACM Conference on Economics and Computation. (729-742).

    https://doi.org/10.1145/3328526.3329573

  • Gamlath B, Kale S and Svensso O. Beating greedy for stochastic bipartite matching. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. (2841-2854).

    /doi/10.5555/3310435.3310611

  • Esfandiari H, Korula N and Mirrokni V. (2018). Allocation with Traffic Spikes. ACM Transactions on Economics and Computation. 6:3-4. (1-23). Online publication date: 26-Nov-2018.

    https://doi.org/10.1145/3105446

  • Wang Y and Wong S. Matroid Online Bipartite Matching and Vertex Cover. Proceedings of the 2016 ACM Conference on Economics and Computation. (437-454).

    https://doi.org/10.1145/2940716.2940793

  • Devanur N, Huang Z, Korula N, Mirrokni V and Yan Q. (2016). Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Transactions on Economics and Computation. 4:3. (1-20). Online publication date: 15-Jun-2016.

    https://doi.org/10.1145/2892563

  • Esfandiari H, Korula N and Mirrokni V. Online Allocation with Traffic Spikes. Proceedings of the Sixteenth ACM Conference on Economics and Computation. (169-186).

    https://doi.org/10.1145/2764468.2764536

  • Korula N, Mirrokni V and Zadimoghaddam M. Online Submodular Welfare Maximization. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (889-898).

    https://doi.org/10.1145/2746539.2746626

  • Agrawal S and Devanur N. Fast algorithms for online stochastic convex programming. Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. (1405-1424).

    /doi/10.5555/2722129.2722222

  • Mehta A, Waggoner B and Zadimoghaddam M. Online stochastic matching with unequal probabilities. Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. (1388-1404).

    /doi/10.5555/2722129.2722221

  • Devanur N, Huang Z, Korula N, Mirrokni V and Yan Q. Whole-page optimization and submodular welfare maximization with online bidders. Proceedings of the fourteenth ACM conference on Electronic commerce. (305-322).

    https://doi.org/10.1145/2492002.2482603

  • Devanur N, Huang Z, Korula N, Mirrokni V and Yan Q. Whole-page optimization and submodular welfare maximization with online bidders. Proceedings of the fourteenth ACM conference on Electronic commerce. (305-322).

    https://doi.org/10.1145/2482540.2482603

  • Haghpanah N, Immorlica N, Mirrokni V and Munagala K. (2013). Optimal Auctions with Positive Network Externalities. ACM Transactions on Economics and Computation. 1:2. (1-24). Online publication date: 1-May-2013.

    https://doi.org/10.1145/2465769.2465778

  • Kapralov M, Post I and Vondrák J. Online submodular welfare maximization. Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms. (1216-1225).

    /doi/10.5555/2627817.2627905

  • Costello K, Tetali P and Tripathi P. Stochastic matching with commitment. Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I. (822-833).

    https://doi.org/10.1007/978-3-642-31594-7_69

  • Laekhanukit B, Oveis Gharan S and Singh M. A rounding by sampling approach to the minimum size k-arc connected subgraph problem. Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I. (606-616).

    https://doi.org/10.1007/978-3-642-31594-7_51

  • Devanur N, Sivan B and Azar Y. Asymptotically optimal algorithm for stochastic adwords. Proceedings of the 13th ACM Conference on Electronic Commerce. (388-404).

    https://doi.org/10.1145/2229012.2229043

  • Alaei S, Hajiaghayi M and Liaghat V. Online prophet-inequality matching with applications to ad allocation. Proceedings of the 13th ACM Conference on Electronic Commerce. (18-35).

    https://doi.org/10.1145/2229012.2229018

  • Devanur N and Jain K. Online matching with concave returns. Proceedings of the forty-fourth annual ACM symposium on Theory of computing. (137-144).

    https://doi.org/10.1145/2213977.2213992

  • Mirrokni V, Gharan S and Zadimoghaddam M. Simultaneous approximations for adversarial and stochastic online budgeted allocation. Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms. (1690-1701).

    /doi/10.5555/2095116.2095250

  • Alaei S, Hajiaghayi M, Liaghat V, Pei D and Saha B. AdCell. Proceedings of the 19th European conference on Algorithms. (311-322).

    /doi/10.5555/2040572.2040608

  • Mahdian M and Yan Q. Online bipartite matching with random arrivals. Proceedings of the forty-third annual ACM symposium on Theory of computing. (597-606).

    https://doi.org/10.1145/1993636.1993716

  • Karande C, Mehta A and Tripathi P. Online bipartite matching with unknown distributions. Proceedings of the forty-third annual ACM symposium on Theory of computing. (587-596).

    https://doi.org/10.1145/1993636.1993715

  • Devanur N, Jain K, Sivan B and Wilkens C. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. Proceedings of the 12th ACM conference on Electronic commerce. (29-38).

    https://doi.org/10.1145/1993574.1993581

  • Devanur N. (2011). Online algorithms with stochastic input. ACM SIGecom Exchanges. 10:2. (40-49). Online publication date: 1-Jun-2011.

    https://doi.org/10.1145/1998549.1998558