Brendan Lucier

Meena Jagadeesan

Proceedings of the ACM on Web Conference 2024, 2024

Revenue Maximization for Buyers with Costly Participation.

[BibT_eX]

[DOI]

Yannai A. Gonczarowski

Yingkai Li

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

Communicating with Anecdotes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Content Filtering with Inattentive Information Consumers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Designing Approximately Optimal Search on Matching Platforms.

[BibT_eX]

[DOI]

Manag. Sci., August, 2023

Algorithmic Persuasion Through Simulation: Information Design in the Age of Generative AI.

[BibT_eX]

[DOI]

CoRR, 2023

Strategic Budget Selection in a Competitive Autobidding World.

[BibT_eX]

[DOI]

Yiding Feng

Aleksandrs Slivkins

CoRR, 2023

Certification Design for a Competitive Market.

[BibT_eX]

[DOI]

Andreas A. Haupt

CoRR, 2023

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics.

[BibT_eX]

[DOI]

CoRR, 2023

Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Making Auctions Robust to Aftermarkets.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Multi-Item Nontruthful Auctions Achieve Good Revenue.

[BibT_eX]

[DOI]

Constantinos Daskalakis

SIAM J. Comput., 2022

Fast Core Pricing for Rich Advertising Auctions.

[BibT_eX]

[DOI]

Oper. Res., 2022

Communicating with Anecdotes.

[BibT_eX]

[DOI]

CoRR, 2022

Truthful Online Scheduling of Cloud Workloads under Uncertainty.

[BibT_eX]

[DOI]

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

On the Effect of Triadic Closure on Network Segregation.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Combinatorial Assortment Optimization.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

SIGecom winter meeting report.

[BibT_eX]

[DOI]

Piotr Dworczak

SIGecom Exch., 2021

On the Impact of Information Acquisition and Aftermarkets on Auction Efficiency.

[BibT_eX]

[DOI]

CoRR, 2021

Revenue Maximization for Buyers with Outside Options.

[BibT_eX]

[DOI]

Yannai A. Gonczarowski

Yingkai Li

CoRR, 2021

Contract Design for Afforestation Programs.

[BibT_eX]

[DOI]

Wanyi Dai Li

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

The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions.

[BibT_eX]

[DOI]

Mete Seref Ahunbay

Adrian Vetta

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions.

[BibT_eX]

[DOI]

Ian A. Kash

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

The Complexity of Black-Box Mechanism Design with Priors.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Christos Tzamos

ACM Trans. Economics and Comput., 2020

An O(log log m) prophet inequality for subadditive combinatorial auctions.

[BibT_eX]

[DOI]

Paul Dütting

Thomas Kesselheim

SIGecom Exch., 2020

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

A Simple and Approximately Optimal Mechanism for an Additive Buyer.

[BibT_eX]

[DOI]

J. ACM, 2020

Simultaneous auctions without complements are (almost) efficient.

[BibT_eX]

[DOI]

Games Econ. Behav., 2020

Non-quasi-linear Agents in Quasi-linear Mechanisms.

[BibT_eX]

[DOI]

CoRR, 2020

Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Simple, Credible, and Approximately-Optimal Auctions.

[BibT_eX]

[DOI]

Constantinos Daskalakis

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

Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer.

[BibT_eX]

[DOI]

Moshe Babaioff

Yannai A. Gonczarowski

Inbal Talgam-Cohen

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

Two-Buyer Sequential Multiunit Auctions with No Overbidding.

[BibT_eX]

[DOI]

Mete Seref Ahunbay

Adrian Vetta

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool.

[BibT_eX]

[DOI]

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

Reducing Inefficiency in Carbon Auctions with Imperfect Competition.

[BibT_eX]

[DOI]

Kira Goldner

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Maximizing Welfare with Incentive-Aware Evaluation Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Black-Box Methods for Restoring Monotonicity.

[BibT_eX]

[DOI]

Evangelia Gergatsouli

Christos Tzamos

Proceedings of the 37th International Conference on Machine Learning, 2020

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Sina Dehghani

Hamid Mahini

Saeed Seddighin

Math. Oper. Res., 2019

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

[BibT_eX]

[DOI]

Shaddin Dughmi

Katrina Ligett

Games Econ. Behav., 2019

Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Online Pandora's Boxes and Bandits.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Michael Mitzenmacher

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Introduction to the Special Issue on EC'15.

[BibT_eX]

[DOI]

Michael Schwarz

ACM Trans. Economics and Comput., 2018

Optimal Data Acquisition for Statistical Estimation.

[BibT_eX]

[DOI]

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

Designing and Evolving an Electronic Agricultural Marketplace in Uganda.

[BibT_eX]

[DOI]

Neil Newman

Lauren Falcao Bergquist

Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, 2018

2017

An economic view of prophet inequalities.

[BibT_eX]

[DOI]

SIGecom Exch., 2017

Equilibria of Greedy Combinatorial Auctions.

[BibT_eX]

[DOI]

Allan Borodin

SIAM J. Comput., 2017

Strategyproof Mechanisms for Competitive Influence in Networks.

[BibT_eX]

[DOI]

Algorithmica, 2017

Approximate Efficiency in Matching Markets.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Beating 1-1/e for ordered prophets.

[BibT_eX]

[DOI]

Melika Abolhassani

Soheil Ehsani

Robert D. Kleinberg

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

Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals.

[BibT_eX]

[DOI]

Robert Kleinberg

Morteza Zadomighaddam

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Repeated Sales with Multiple Strategic Buyers.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Samuel Taggart

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

Robust Optimization for Non-Convex Objectives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees.

[BibT_eX]

[DOI]

Robert Kleinberg

Kevin Leyton-Brown

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Market Pricing for Data Streams.

[BibT_eX]

[DOI]

Melika Abolhassani

Hadi Yami

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions.

[BibT_eX]

[DOI]

Allan Borodin

ACM Trans. Economics and Comput., 2016

Combinatorial Walrasian Equilibrium.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Finding Bidder-Optimal Core Points Quickly.

[BibT_eX]

[DOI]

CoRR, 2016

Posted Prices, Smoothness, and Combinatorial Prophet Inequalities.

[BibT_eX]

[DOI]

CoRR, 2016

From Duels to Battefields: Computing Equilibria of Blotto and Other Games.

[BibT_eX]

[DOI]

Mahdi Ahmadinejad

Sina Dehghani

Hamid Mahini

Saeed Seddighin

CoRR, 2016

On-Demand or Spot? Selling the Cloud to Risk-Averse Customers.

[BibT_eX]

[DOI]

Darrell Hoy

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Correlated and Coarse Equilibria of Single-Item Auctions.

[BibT_eX]

[DOI]

Noam Nisan

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

The price of anarchy in large games.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Procrastination with Variable Present Bias.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

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

Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

2015

Bounding the inefficiency of outcomes in generalized second price auctions.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

J. Econ. Theory, 2015

On Welfare Approximation and Stable Pricing.

[BibT_eX]

[DOI]

CoRR, 2015

The (Non)-Existence of Stable Mechanisms in Incomplete Information Environments.

[BibT_eX]

[DOI]

Nick Arnosti

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Combinatorial Auctions via Posted Prices.

[BibT_eX]

[DOI]

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

Greedy Algorithms Make Efficient Mechanisms.

[BibT_eX]

[DOI]

Vasilis Syrgkanis

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Randomization Beats Second Price as a Prior-Independent Auction.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Truthful Online Scheduling with Commitments.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Influence at Scale: Distributed Computation of Complex Contagion in Networks.

[BibT_eX]

[DOI]

Joel Oren

Yaron Singer

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014

A Unifying Hierarchy of Valuations with Complements and Substitutes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

User satisfaction in competitive sponsored search.

[BibT_eX]

[DOI]

David Kempe

Proceedings of the 23rd International World Wide Web Conference, 2014

Influence Maximization in Undirected Networks.

[BibT_eX]

[DOI]

Sanjeev Khanna

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Maximizing Social Influence in Nearly Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the efficiency of the walrasian mechanism.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

Clearing Markets via Bundles.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

Online (Budgeted) Social Choice.

[BibT_eX]

[DOI]

Joel Oren

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Setting equilibrium prices, approximately.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Equilibrium in Combinatorial Public Projects.

[BibT_eX]

[DOI]

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

Limits of Efficiency in Sequential Auctions.

[BibT_eX]

[DOI]

Vasilis Syrgkanis

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

Simultaneous auctions are (almost) efficient.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Efficient online scheduling for deadline-sensitive jobs: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Cost-recovering bayesian algorithmic mechanism design.

[BibT_eX]

[DOI]

Hu Fu

Balasubramanian Sivan

Vasilis Syrgkanis

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Pricing public goods for private sale.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Bertrand networks.

[BibT_eX]

[DOI]

Moshe Babaioff

Noam Nisan

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Equilibria of Online Scheduling Algorithms.

[BibT_eX]

[DOI]

Itai Ashlagi

Moshe Tennenholtz

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information.

[BibT_eX]

[DOI]

PhD thesis, 2012

Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution

[BibT_eX]

[DOI]

CoRR, 2012

Truthful Mechanisms for Competing Submodular Processes

[BibT_eX]

[DOI]

CoRR, 2012

On the efficiency of equilibria in generalized second price auctions

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

CoRR, 2012

On revenue in the generalized second price auction.

[BibT_eX]

[DOI]

Renato Paes Leme

Éva Tardos

Proceedings of the 21st World Wide Web Conference 2012, 2012

The Power of Local Information in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

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

[BibT_eX]

[DOI]

Shuchi Chawla

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

2011

The Glauber Dynamics for Colorings of Bounded Degree Trees.

[BibT_eX]

[DOI]

Michael Molloy

SIAM J. Discret. Math., 2011

On the Impossibility of Black-Box Transformations in Mechanism Design

[BibT_eX]

[DOI]

Shuchi Chawla

CoRR, 2011

Dueling algorithms.

[BibT_eX]

[DOI]

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

GSP auctions with correlated types.

[BibT_eX]

[DOI]

Renato Paes Leme

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

The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

2010

Improved Social Welfare Bounds for GSP at Equilibrium

[BibT_eX]

[DOI]

Renato Paes Leme

CoRR, 2010

Bayesian algorithmic mechanism design.

[BibT_eX]

[DOI]

Jason D. Hartline

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

Price of Anarchy for Greedy Auctions.

[BibT_eX]

[DOI]

Allan Borodin

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

Cooperation in anonymous dynamic social networks.

[BibT_eX]

[DOI]

Brian Rogers

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

2009

Local overlaps in special unfoldings of convex polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2009

The Glauber Dynamics for Colourings of Bounded Degree Trees.

[BibT_eX]

[DOI]

Michael Molloy

Yuval Peres

Proceedings of the Approximation, 2009

2008

Binary Morphisms to Ultimately Periodic Words

[BibT_eX]

[DOI]

CoRR, 2008

2007

Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility.

[BibT_eX]

[DOI]

Tao Jiang

Ming Li

Inf. Process. Lett., 2007

SQL Anywhere: An Embeddable DBMS.

[BibT_eX]

[DOI]

IEEE Data Eng. Bull., 2007

SQL Anywhere: A Holistic Approach to Database Self-management.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering Workshops, 2007

2004

Construction of a Function Using a Fibonacci Numeration System

[BibT_eX]

[DOI]