Martin Pál

Oper. Res., 2021

Variable Decomposition for Prophet Inequalities and Optimal Ordering.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Competing Optimally Against An Imperfect Prophet.

[BibT_eX]

[DOI]

CoRR, 2020

2018

Improved Approximations for Free-Order Prophets and Second-Price Auctions.

[BibT_eX]

[DOI]

CoRR, 2018

2016

A Field Guide to Personalized Reserve Prices.

[BibT_eX]

[DOI]

Renato Paes Leme

Sergei Vassilvitskii

Proceedings of the 25th International Conference on World Wide Web, 2016

2012

Improved algorithms for orienteering and related problems.

[BibT_eX]

[DOI]

Nitish Korula

ACM Trans. Algorithms, 2012

2011

Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

2010

Contextual Multi-Armed Bandits.

[BibT_eX]

[DOI]

Tyler Lu

Dávid Pál

Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Iterated Allocations with Delayed Feedback

[BibT_eX]

[DOI]

Sudipto Guha

Kamesh Munagala

CoRR, 2010

Stochastic Models for Budget Optimization in Search-Based Advertising.

[BibT_eX]

[DOI]

S. Muthukrishnan

Zoya Svitkina

Algorithmica, 2010

2009

General auction mechanism for search advertising.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on World Wide Web, 2009

Online Ad Assignment with Free Disposal.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

An online mechanism for ad slot reservations with cancellations.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Secretary Problems on Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Nitish Korula

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Theory research at Google.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

Anastasios Sidiropoulos

SIGACT News, 2008

Online Ad Slotting With Cancellations

[BibT_eX]

[DOI]

CoRR, 2008

Sponsored Search Auctions with Markovian Users.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Truthful Mechanism for Offline Ad Slot Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Proportional Fairness in Multi-Rate Wireless LANs.

[BibT_eX]

[DOI]

Li (Erran) Li

Yang Richard Yang

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.

[BibT_eX]

[DOI]

Theory Comput., 2007

Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Approximation Algorithms for Stochastic Inventory Control Models.

[BibT_eX]

[DOI]

Math. Oper. Res., 2007

Approximation via cost sharing: Simpler and better approximation algorithms for network design.

[BibT_eX]

[DOI]

J. ACM, 2007

Budget optimization in search-based advertising auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Admission control for multihop wireless backhaul networks with QoS support.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

Cost Sharing and Approximation.

[BibT_eX]

PhD thesis, 2005

The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2005

Stochastic Steiner Trees Without a Root.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A Recursive Greedy Algorithm for Walks in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Unbalanced Graph Cuts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2005

Sampling Bounds for Stochastic Optimization.

[BibT_eX]

[DOI]

Moses Charikar

Proceedings of the Approximation, 2005

2004

Boosted sampling: approximation algorithms for stochastic optimization.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Optimization, Games, and Quantified Constraint Satisfaction.

[BibT_eX]

[DOI]

Hubie Chen

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Group Strategyproof Mechanisms via Primal-Dual Algorithms.

[BibT_eX]

[DOI]

Éva Tardos

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Universal Facility Location.

[BibT_eX]

[DOI]

Mohammad Mahdian

Proceedings of the Algorithms, 2003

2001

Facility Location with Nonuniform Hard Capacities.

[BibT_eX]

[DOI]