Renato Paes Leme

Orcid: 0000-0002-9799-5766

According to our database1, Renato Paes Leme authored at least 89 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Bernoulli Factories for Flow-Based Polytopes.
SIAM J. Discret. Math., March, 2024

Winner-Pays-Bid Auctions Minimize Variance.
CoRR, 2024

2023
Ex-post Individually Rational Bayesian Persuasion.
CoRR, 2023

Mechanism Design for Large Language Models.
CoRR, 2023

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals.
CoRR, 2023

Bandits with Deterministically Evolving States.
CoRR, 2023

Bayesian Conversations.
CoRR, 2023

U-Calibration: Forecasting for an Unknown Agent.
CoRR, 2023

Eligibility Mechanisms: Auctions Meet Information Retrieval.
Proceedings of the ACM Web Conference 2023, 2023

Pricing Query Complexity of Revenue Maximization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Description Complexity of Regular Distributions.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

U-Calibration: Forecasting for an Unknown Agent.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Contextual Search via Intrinsic Volumes.
SIAM J. Comput., 2022

Linear Program-Based Approximation for Personalized Reserve Prices.
Manag. Sci., 2022

Dynamic Double Auctions: Toward First Best.
Oper. Res., 2022

Multiparameter Bernoulli Factories.
CoRR, 2022

Calibrated Click-Through Auctions.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Interactive Communication in Bilateral Trade.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Corruption-Robust Contextual Search through Density Updates.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms.
Oper. Res., 2021

Calibrated Click-Through Auctions: An Information Design Approach.
CoRR, 2021

Auction Design for ROI-Constrained Buyers.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Combinatorial Bernoulli factories: matchings, flows, and other polytopes.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Optimal Contextual Pricing and Extensions.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Non-Excludable Dynamic Mechanism Design.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Variable Decomposition for Prophet Inequalities and Optimal Ordering.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

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

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Jointly Learning Prices and Product Features.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Learning to Price Against a Moving Target.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Computing Walrasian equilibria: fast algorithms and structural properties.
Math. Program., 2020

On the Construction of Substitutes.
Math. Oper. Res., 2020

Feature-Based Dynamic Pricing.
Manag. Sci., 2020

Clinching auctions with online supply.
Games Econ. Behav., 2020

Competing Optimally Against An Imperfect Prophet.
CoRR, 2020

Contextual Search for General Hypothesis Classes.
CoRR, 2020

Why Do Competitive Markets Converge to First-Price Auctions?
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

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

Bandits with Adversarial Scaling.
Proceedings of the 37th International Conference on Machine Learning, 2020

Costly Zero Order Oracles.
Proceedings of the Conference on Learning Theory, 2020

2019
Dynamic Double Auctions: Towards First Best.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Secretary Ranking with Minimal Inversions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Learning to Clear the Market.
Proceedings of the 36th International Conference on Machine Learning, 2019

LP-based Approximation for Personalized Reserve Prices.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Optimal Dynamic Auctions Are Virtual Welfare Maximizers.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Dynamic Contracting under Positive Commitment.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Pareto Efficient Auctions with Interest Rates.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Dynamic Mechanisms with Martingale Utilities.
Manag. Sci., 2018

Multidimensional Binary Search for Contextual Decision-Making.
Oper. Res., 2018

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

Dynamic Mechanism Design in the Field.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Stochastic bandits robust to adversarial corruptions.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Non-clairvoyant Dynamic Mechanism Design.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Ellipsoids for contextual dynamic pricing.
SIGecom Exch., 2017

Gross substitutability: An algorithmic survey.
Games Econ. Behav., 2017

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

Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Tight Bounds for Approximate Carathéodory and Beyond.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Optimal dynamic mechanisms with ex-post IR via bank accounts.
CoRR, 2016

A Field Guide to Personalized Reserve Prices.
Proceedings of the 25th International Conference on World Wide Web, 2016

Where to Sell: Simulating Auctions From Learning Algorithms.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Dynamic Auctions with Bank Accounts.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Reservation Exchange Markets for Internet Advertising.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory, 2015

Polyhedral Clinching Auctions and the AdWords Polytope.
J. ACM, 2015

Computing Walrasian Equilibria: Fast Algorithms and Economic Insights.
CoRR, 2015

Core-competitive Auctions.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Price Competition, Fluctuations and Welfare Guarantees.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Signaling Schemes for Revenue Maximization.
ACM Trans. Economics and Comput., 2014

Price competition in online combinatorial markets.
Proceedings of the 23rd International World Wide Web Conference, 2014

Clinching auctions beyond hard budget constraints.
Proceedings of the ACM Conference on Economics and Computation, 2014

On the efficiency of the walrasian mechanism.
Proceedings of the ACM Conference on Economics and Computation, 2014

Efficiency Guarantees in Auctions with Budgets.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Role of conformity in opinion dynamics in social networks.
Proceedings of the second ACM conference on Online social networks, 2014

2013
Design and Analysis of Sponsored Search Mechanisms.
PhD thesis, 2013

Clinching Auction with Online Supply.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Pricing public goods for private sale.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
The dining bidder problem: à la russe et à la française.
SIGecom Exch., 2012

On the efficiency of equilibria in generalized second price auctions
CoRR, 2012

On revenue in the generalized second price auction.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Sequential auctions and externalities.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Optimal mechanisms for selling information.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

The curse of simultaneity.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
GSP auctions with correlated types.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
Improved Social Welfare Bounds for GSP at Equilibrium
CoRR, 2010

Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
Symmetry-based Completion.
Proceedings of the GRAPP 2009, 2009

2006
A Set of NP-Extraction Rules for Portuguese: Defining, Learning and Pruning.
Proceedings of the Computational Processing of the Portuguese Language, 2006


  Loading...