Shuchi Chawla

Thodoris Lykouris

Oper. Res., 2024

A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization.

[BibT_eX]

[DOI]

CoRR, 2024

Composition of nested embeddings with an application to outlier removal.

[BibT_eX]

[DOI]

Kristin Sheridan

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

Non-Adaptive Matroid Prophet Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Online Time-Windows TSP with Predictions.

[BibT_eX]

[DOI]

Dimitris Christou

Proceedings of the Approximation, 2024

2023

Buy-Many Mechanisms for Many Unit-Demand Buyers.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Approximating Pandora's Box with Correlations.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Jeremy McMahan

Proceedings of the Approximation, 2023

2022

Buy-many mechanisms are not much better than item pricing.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

Simple pricing schemes for consumers with evolving values.

[BibT_eX]

[DOI]

Anna R. Karlin

Games Econ. Behav., 2022

To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online.

[BibT_eX]

[DOI]

CoRR, 2022

Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review.

[BibT_eX]

[DOI]

CoRR, 2022

Pricing ordered items.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Individual Fairness in Advertising Auctions Through Inverse Proportionality.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Individually-Fair Auctions for Multi-Slot Sponsored Search.

[BibT_eX]

[DOI]

Rojin Rezvan

Nathaniel Sauerberg

Proceedings of the 3rd Symposium on Foundations of Responsible Computing, 2022

2021

Timing Matters: Online Dynamics in Broadcast Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020.

[BibT_eX]

[DOI]

CoRR, 2021

Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract).

[BibT_eX]

[DOI]

Thodoris Lykouris

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020

Buy-many mechanisms: what are they and why should you care?

[BibT_eX]

[DOI]

SIGecom Exch., 2020

Fairness in ad auctions through inverse proportionality.

[BibT_eX]

[DOI]

CoRR, 2020

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Themis: Fair and Efficient GPU Cluster Scheduling.

[BibT_eX]

[DOI]

Kshiteej Mahajan

Arjun Balasubramanian

Arjun Singhvi

Shivaram Venkataraman

Aditya Akella

Amar Phanishayee

Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation, 2020

Pandora's Box with Correlations: Learning and Approximation.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Ruimin Zhang

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Multi-category fairness in sponsored search auctions.

[BibT_eX]

[DOI]

Christina Ilvento

Proceedings of the FAT* '20: Conference on Fairness, 2020

2019

Revenue Maximization for Query Pricing.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Optimal crowdsourcing contests.

[BibT_eX]

[DOI]

Games Econ. Behav., 2019

Learning Optimal Search Algorithms from Data.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Ruimin Zhang

CoRR, 2019

Themis: Fair and Efficient GPU Cluster Scheduling for Machine Learning Workloads.

[BibT_eX]

[DOI]

Kshiteej Mahajan

Arjun Singhvi

Arjun Balasubramanian

Varun Batra

Surya Teja Chavali

Shivaram Venkataraman

Aditya Akella

Amar Phanishayee

CoRR, 2019

Individual Fairness in Sponsored Search Auctions.

[BibT_eX]

[DOI]

Christina Ilvento

CoRR, 2019

Reasonable multi-item mechanisms are not much better than item pricing.

[BibT_eX]

[DOI]

CoRR, 2019

Pricing for Online Resource Allocation: Intervals and Paths.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Revenue Maximization with an Uncertainty-Averse Buyer.

[BibT_eX]

[DOI]

Kira Goldner

Emmanouil Pountourakis

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Dynamic Query Re-Planning using QOOP.

[BibT_eX]

[DOI]

Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation, 2018

2017

Mechanism Redesign.

[BibT_eX]

[DOI]

Denis Nekipelov

CoRR, 2017

Pricing for Online Resource Allocation: Beyond Subadditive Values.

[BibT_eX]

[DOI]

CoRR, 2017

Aversion to Uncertainty and Its Implications for Revenue Maximization.

[BibT_eX]

[DOI]

Kira Goldner

Emmanouil Pountourakis

CoRR, 2017

Stability of service under time-of-use pricing.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Truth and Regret in Online Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Sparsest Cut.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Multicut.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Mechanism Design for Subadditive Agents via an Ex Ante Relaxation.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

A/B Testing of Auctions.

[BibT_eX]

[DOI]

Denis Nekipelov

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

Pricing lotteries.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

The power of randomness in Bayesian optimal mechanism design.

[BibT_eX]

[DOI]

Games Econ. Behav., 2015

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011.

[BibT_eX]

[DOI]

Games Econ. Behav., 2015

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs.

[BibT_eX]

[DOI]

Konstantin Makarychev

Tselil Schramm

Grigory Yaroslavtsev

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Bayesian algorithmic mechanism design.

[BibT_eX]

[DOI]

SIGecom Exch., 2014

Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs.

[BibT_eX]

[DOI]

Konstantin Makarychev

Tselil Schramm

Grigory Yaroslavtsev

CoRR, 2014

How to sell an app: pay-per-play or buy-it-now?

[BibT_eX]

[DOI]

Anna R. Karlin

CoRR, 2014

Mechanism design for data science.

[BibT_eX]

[DOI]

Denis Nekipelov

Proceedings of the ACM Conference on Economics and Computation, 2014

Approximate revenue maximization in interdependent value settings.

[BibT_eX]

[DOI]

Hu Fu

Anna R. Karlin

Proceedings of the ACM Conference on Economics and Computation, 2014

Network Design with Coverage Costs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

Foreword to the Special Issue on SODA'11.

[BibT_eX]

[DOI]

Prasad Raghavendra

Dana Randall

ACM Trans. Algorithms, 2013

A 2-Approximation for Redundancy Aware Network Design with Laminar Demands

[BibT_eX]

[DOI]

CoRR, 2013

Prior-independent mechanisms for scheduling.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Auctions with unique equilibria.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

On the limits of black-box reductions in mechanism design.

[BibT_eX]

[DOI]

Nicole Immorlica

Brendan Lucier

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Traffic-redundancy aware network design.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Secretary Problems with Convex Costs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Bicriteria Approximation for the Reordering Buffer Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Better Internet routing through intrinsic support for selfishness.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012

2011

Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008).

[BibT_eX]

[DOI]

Cynthia Dwork

Venkatesan Guruswami

SIAM J. Comput., 2011

On the Impossibility of Black-Box Transformations in Mechanism Design

[BibT_eX]

[DOI]

Nicole Immorlica

Brendan Lucier

CoRR, 2011

De-ossifying internet routing through intrinsic support for end-network and ISP selfishness.

[BibT_eX]

[DOI]

Proceedings of the SIGMETRICS 2011, 2011

Bayesian mechanism design for budget-constrained agents.

[BibT_eX]

[DOI]

Azarakhsh Malekian

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Threshold Rules for Online Sample Selection.

[BibT_eX]

[DOI]

Eric Bach

Discret. Math. Algorithms Appl., 2010

Multi-parameter mechanism design and sequential posted pricing.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Pricing Randomized Allocations.

[BibT_eX]

[DOI]

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

Region Growing for Multi-Route Cuts.

[BibT_eX]

[DOI]

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

2009

Bertrand competition in networks.

[BibT_eX]

[DOI]

Feng Niu

SIGecom Exch., 2009

Sequential Posted Pricing and Multi-parameter Mechanism Design

[BibT_eX]

[DOI]

CoRR, 2009

Packing multiway cuts in capacitated graphs.

[BibT_eX]

[DOI]

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

The price of anarchy in bertrand games.

[BibT_eX]

[DOI]

Feng Niu

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

2008

Sparsest Cut.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Multicut.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.

[BibT_eX]

[DOI]

Anupam Gupta

Harald Räcke

ACM Trans. Algorithms, 2008

Bertrand Competition in Networks.

[BibT_eX]

[DOI]

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

2007

Approximation Algorithms for Orienteering and Discounted-Reward TSP.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Algorithmic pricing via virtual valuations.

[BibT_eX]

[DOI]

Robert D. Kleinberg

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

2006

Min-Max payoffs in a two-player location game.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

On the Hardness of Approximating Multicut and Sparsest-Cut.

[BibT_eX]

[DOI]

Comput. Complex., 2006

Optimal Cost-Sharing Mechanisms for Steiner Forest Problems.

[BibT_eX]

[DOI]

Mukund Sundararajan

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Bayesian Optimal No-Deficit Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Single-Source Stochastic Routing.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

On Privacy-Preserving Histograms.

[BibT_eX]

[DOI]

Proceedings of the UAI '05, 2005

Toward Privacy in Public Databases.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

2004

Correlation Clustering.

[BibT_eX]

[DOI]

Nikhil Bansal

Avrim Blum

Mach. Learn., 2004

Mechanism design for coalition formation and cost sharing in group-buying markets.

[BibT_eX]

[DOI]

Electron. Commer. Res. Appl., 2004

On the scaling of congestion in the internet graph.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 2004

Approximation algorithms for deadline-TSP and vehicle routing with time-windows.

[BibT_eX]

[DOI]

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

Worst-case payoffs of a location game.

[BibT_eX]

[DOI]

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

2003

Static Optimality and Dynamic Search-Optimality in Lists and Trees.

[BibT_eX]

[DOI]

Avrim Blum

Adam Kalai

Algorithmica, 2003

Online oblivious routing.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Profit guaranteeing mechanisms for multicast networks.

[BibT_eX]

[DOI]

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

Scaling properties of the Internet graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Scheduling for Flow-Time with Admission Control.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Mechanisms for coalition formation and cost sharing in an electronic marketplace.

[BibT_eX]

[DOI]

Cuihong Li

Uday Rajan

Katia Sycara-Cyranski

Proceedings of the 5th International Conference on Electronic Commerce, 2003

2001

Learning from Labeled and Unlabeled Data using Graph Mincuts.

[BibT_eX]

Avrim Blum

Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28, 2001

QoS based scheduling for incorporating variable rate coded voice in Bluetooth.

[BibT_eX]

[DOI]