Ron Lavi

Orcid: 0000-0002-5215-5165

According to our database1, Ron Lavi authored at least 54 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes.
Math. Oper. Res., 2024

Technical Note - Incomplete Information VCG Contracts for Common Agency.
Oper. Res., 2024

2023
From Monopoly to Competition: Optimal Contests Prevail.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Redesigning Bitcoin's Fee Market.
ACM Trans. Economics and Comput., 2022

Principal-agent VCG contracts.
J. Econ. Theory, 2022

2021
Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation.
J. Artif. Intell. Res., 2021

Option values in sequential auctions with time-varying valuations.
Int. J. Game Theory, 2021

Unified Fair Allocation of Goods and Chores via Copies.
CoRR, 2021

Optimal DSIC Auctions for Correlated Private Values: Ex-Post Vs. Ex-Interim IR.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Incomplete Information VCG Contracts for Common Agency.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-name Manipulation.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Bayesian generalized network design.
Theor. Comput. Sci., 2020

Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency.
J. ACM, 2020

No-Regret Stateful Posted Pricing.
CoRR, 2020

A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Competition Among Contests: a Safety Level Analysis.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

VCG under Sybil (False-Name) Attacks - A Bayesian Analysis.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Deterministic Leader Election in Programmable Matter.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Traffic Light Scheduling, Value of Time, and Incentives.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2016
Algorithmic Mechanism Design.
Encyclopedia of Algorithms, 2016

Preface to Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2016

2015
Online ascending auctions for gradually expiring items.
J. Econ. Theory, 2015

2014
Efficiency levels in sequential auctions with dynamic arrivals.
Int. J. Game Theory, 2014

2013
Ascending auctions and Walrasian equilibrium
CoRR, 2013

Competition among asymmetric sellers with fixed supply.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Composition Games for Distributed Systems: The EU Grant Games.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Optimal Lower Bounds for Anonymous Scheduling Mechanisms.
Math. Oper. Res., 2012

Side-communication yields efficiency of ascending auctions: The two-items case.
Games Econ. Behav., 2012

Multi-unit auctions with budget limits.
Games Econ. Behav., 2012

Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Efficiency of sequential english auctions with dynamic arrivals.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Sequential voting with externalities: herding in social networks.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Composition games for distributed systems: The EU grant games (abstract).
Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

2011
Truthful and Near-Optimal Mechanism Design via Linear Programming.
J. ACM, 2011

A Note on the Incompatibility of Strategy-Proofness and Pareto-Optimality in Quasi-Linear Settings with Public Budgets - Working Paper.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2009
Mechanism Design.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

VCG is the best anonymous scheduling mechanism.
SIGecom Exch., 2009

Two simplified proofs for Roberts' theorem.
Soc. Choice Welf., 2009

Single-value combinatorial auctions and algorithmic implementation in undominated strategies.
J. ACM, 2009

Truthful mechanism design for multidimensional scheduling via cycle monotonicity.
Games Econ. Behav., 2009

An optimal lower bound for anonymous scheduling mechanisms.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

2008
Algorithmic Mechanism Design.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Searching for the possibility: impossibility border of truthful mechanism design.
SIGecom Exch., 2007

Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006
Single-value combinatorial auctions and implementation in undominated strategies.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Impersonation-Based Mechanisms.
Proceedings of the Proceedings, 2006

2005
Mechanism Design for Single-Value Domains.
Proceedings of the Proceedings, 2005

2004
Auction theory in computational settings (תורת המכרזים עבור מערכות ממוחשבות.).
PhD thesis, 2004

Competitive analysis of incentive compatible on-line auctions.
Theor. Comput. Sci., 2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
Proceedings of the STACS 2004, 2004

2003
Towards a Characterization of Truthful Combinatorial Auctions.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2001
The Home Model and Competitive Algorithms for Load Balancing in a Computing Cluster.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

1998
Improving the PVM Daemon Network Performance by Direct Network Access.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1998


  Loading...