Ron Lavi

According to our database1, Ron Lavi authored at least 38 papers between 1998 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Redesigning Bitcoin's fee market.
Proceedings of the World Wide Web Conference, 2019

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

Principal-Agent VCG Contracts.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 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

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

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

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
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

Side-Communication Yields Efficiency of Ascending Auctions: The Two-Items Case.
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

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

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

Two simplified proofs for Roberts' theorem.
Social Choice and Welfare, 2009

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

Truthful mechanism design for multidimensional scheduling via cycle monotonicity.
Games and Economic Behavior, 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

Multi-unit Auctions with Budget Limits.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Searching for the possibility: impossibility border of truthful mechanism design.
SIGecom Exchanges, 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
Online ascending auctions for gradually expiring items.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Truthful and Near-Optimal Mechanism Design via Linear Programming.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

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

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

2000
Competitive analysis of incentive compatible on-line auctions.
Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), 2000

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...