Aranyak Mehta

CoRR, 2024

Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints.

[BibT_eX]

[DOI]

Christopher Liaw

Wennan Zhu

Proceedings of the ACM on Web Conference 2024, 2024

User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization.

[BibT_eX]

[DOI]

Proceedings of the ACM on Web Conference 2024, 2024

Prior-Independent Auctions for Heterogeneous Bidders.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Reward Selection with Noisy Observations.

[BibT_eX]

[DOI]

Kamyar Azizzadenesheli

CoRR, 2023

The Power of Two-sided Recruitment in Two-sided Markets.

[BibT_eX]

[DOI]

CoRR, 2023

User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization.

[BibT_eX]

[DOI]

CoRR, 2023

Auctions without commitment in the auto-bidding world.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Efficiency of Non-Truthful Auctions in Auto-bidding: The Power of Randomization.

[BibT_eX]

[DOI]

Christopher Liaw

Proceedings of the ACM Web Conference 2023, 2023

Incentive Compatibility in the Auto-bidding World.

[BibT_eX]

[DOI]

Yeganeh Alimohammadi

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Prior-Independent Auctions for Heterogeneous Bidders.

[BibT_eX]

[DOI]

CoRR, 2022

Efficiency of non-truthful auctions under auto-bidding.

[BibT_eX]

[DOI]

Christopher Liaw

CoRR, 2022

Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG.

[BibT_eX]

[DOI]

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training.

[BibT_eX]

[DOI]

CoRR, 2020

Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Autobidding with Constraints.

[BibT_eX]

[DOI]

Gagan Aggarwal

Ashwinkumar Badanidiyuru

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

A new dog learns old tricks: RL finds classic optimization algorithms.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

Is Shapley cost sharing optimal?

[BibT_eX]

[DOI]

Games Econ. Behav., 2018

Optimizing Ad Refresh In Mobile App Advertising.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2015

Online Stochastic Matching with Unequal Probabilities.

[BibT_eX]

[DOI]

Bo Waggoner

Morteza Zadimoghaddam

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Biobjective Online Bipartite Matching.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013

Online Matching and Ad Allocation.

[BibT_eX]

[DOI]

Found. Trends Theor. Comput. Sci., 2013

Optimizing budget constrained spend in search advertising.

[BibT_eX]

[DOI]

Chinmay Karande

Ramakrishnan Srikant

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Designing Markets for Daily Deals.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Online Graph Edge-Coloring in the Random-Order Arrival Model.

[BibT_eX]

[DOI]

Bahman Bahmani

Rajeev Motwani

Theory Comput., 2012

Online Matching with Stochastic Rewards.

[BibT_eX]

[DOI]

Debmalya Panigrahi

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Pricing commodities.

[BibT_eX]

[DOI]

Robert Krauthgamer

Atri Rudra

Theor. Comput. Sci., 2011

Online bipartite matching with unknown distributions.

[BibT_eX]

[DOI]

Chinmay Karande

Pushkar Tripathi

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Design is as Easy as Optimization.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

SIAM J. Discret. Math., 2010

A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.

[BibT_eX]

[DOI]

Bahman Bahmani

Rajeev Motwani

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A note on approximate Nash equilibria.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Christos H. Papadimitriou

Theor. Comput. Sci., 2009

Beyond Moulin mechanisms.

[BibT_eX]

[DOI]

Tim Roughgarden

Mukund Sundararajan

Games Econ. Behav., 2009

On the Fourier spectrum of symmetric Boolean functions.

[BibT_eX]

[DOI]

Mihail N. Kolountzakis

Comb., 2009

Efficiency of (revenue-)optimal mechanisms.

[BibT_eX]

[DOI]

Gagan Aggarwal

Gagan Goel

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Online Stochastic Matching: Beating 1-1/e.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.

[BibT_eX]

[DOI]

Algorithmica, 2008

Online budgeted matching in random input models with applications to Adwords.

[BibT_eX]

[DOI]

Gagan Goel

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Greedy List Intersection.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

An auction-based market equilibrium algorithm for a production model.

[BibT_eX]

[DOI]

Sanjiv Kapoor

Theor. Comput. Sci., 2007

AdWords and generalized online matching.

[BibT_eX]

[DOI]

J. ACM, 2007

Adwords Auctions with Decreasing Valuation Bids.

[BibT_eX]

[DOI]

Gagan Goel

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.

[BibT_eX]

[DOI]

Robert Krauthgamer

Atri Rudra

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Progress in approximate nash equilibria.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Christos H. Papadimitriou

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

Some results on approximating the minimax solution in approval voting.

[BibT_eX]

[DOI]

Rob LeGrand

Evangelos Markakis

Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

2006

Posted price profit maximization for multicast by approximating fixed points.

[BibT_eX]

[DOI]

Scott Shenker

J. Algorithms, 2006

2005

Caching with Expiration Times for Internet Applications.

[BibT_eX]

[DOI]

Internet Math., 2005

On earthmover distance, metric labeling, and 0-extension

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

A Simple Characterization for Truth-Revealing Single-Item Auctions.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Fairness and optimality in congestion games.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

Viswanath Nagarajan

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

AdWords and Generalized On-line Matching.

[BibT_eX]

[DOI]

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

On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Randomized truthful auctions of digital goods are randomizations over truthful auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003

Profit-maximizing multicast pricing by approximating fixed points.

[BibT_eX]

[DOI]

Scott Shenker

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Playing large games using simple strategies.

[BibT_eX]

[DOI]

Richard J. Lipton

Evangelos Markakis

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Randomized Time-Space Tradeoffs for Directed Graph Connectivity.

[BibT_eX]

[DOI]

Parikshit Gopalan

Richard J. Lipton

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Caching with expiration times.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000

Keeping Track of the Latest Gossip in Shared Memory Systems.

[BibT_eX]

[DOI]

Bharat Adsul