Ron Lavi

Senior Lecturer,
Faculty of Industrial Engineering and Management
The Technion, Israel
E-mail: ronlavi@ie.technion.ac.il
Office: Bloomfield 302
Phone: 04-8294410
I am looking for graduate
students who are interested in doing research in auction theory
and in game-theoretic models for computational settings. Interested
students can contact
me by email or by phone. Possible list of research topics can be
found here.
Courses
Auction
Theory (96573) - will be given in the Fall (semester A) of 2006/2007
Research Interests
My research interests are in subjects on the
border
of Computer Science, Game Theory, and Economics.
I study models that integrate computational and algorithmic theory with
game theory and microeconomic
theory. Some representative questions that my research explores are:
(i) What are the limits of ex-post
implementability in private value settings. (ii) What other solution
concepts can we successfully use in
a distribution free analysis? (iii) What types of dynamic and detail
free mechanisms can we construct?
The motivation for these questions arise from Auction Theory, a
research area with theoretical as well
as practical relevance.
Short Bibliography
I joined the Technion in the summer of 2006, after a two-year post-doc
at the
Social and Information Sciences
Laboratory (SISL)
at the California Institute of Technology. I
have a Phd in Computer Science from the
Hebrew University, Jerusalem, Israel.
Here is my full CV. On the
informal side, here
are some pictures.
Publications:
- Weak
Monotonicity characterizes deterministic dominant strategy
implementation,
by S. Bikhchandani, S. Chatterji, R. Lavi, A. Mu'alem, N.
Nisan, and A. Sen
In Econometrica, vol.
74(4), pp. 1109-1132, July 2006.
See also the supplementary
material for this paper.
- Impersonation-Based
Mechanisms,
By Moshe Babaioff, Ron Lavi,
and Elan Pavlov
In AAAI-06,
July 2006.
- Single
Value Combinatorial Auctions and Implementation in Undominated
Strategies,
By Moshe Babaioff, Ron Lavi, and Elan Pavlov
An Extended
Abstract appeared in SODA'06.
PPT
slides
- Truthful
and Near-optimal Mechanism Design via Linear Programming,
By Ron Lavi and Chaitanya Swamy
An Extended
Abstract appeared in FOCS'05
PPT
slides
- Mechanism
Design for Single-Value Domains,
By Moshe Babaioff, Ron Lavi, and Elan Pavlov
In AAAI-05,
July 2005.
- Online
Ascending Auctions for Gradually Expiring Items,
By Ron Lavi and Noam Nisan
An Extended
Abstract appeared in SODA'05.
PPT
slides
- Online
competitive algorithms for maximizing weighted throughput of unit jobs,
By Y. Bartal, F.Y.L. Chin, M. Chrobak, S.P.Y. Fung, W. Jawor, R. Lavi,
J. Sgall,
T. Tichy
In STACS'04.
- Two
Simplified Proofs for Roberts' Theorem,
By Ron Lavi, Ahuva Mu'alem, and Noam Nisan
Working paper. Comments are welcomed.
- Towards
a Characterization of Truthful Combinatorial Auctions,
By Ron Lavi, Ahuva Mu'alem, and Noam Nisan
An Extended
Abstract appeared in FOCS'03.
PPT
slides
- Competitive
Analysis of Incentive Compatible On-Line Auctions,
by Ron Lavi and Noam Nisan
In
Theoretical Computer Science 310(1), pp. 159-180, 2004.
Preliminary version appeared in ACM-EC'00,
October 2000.
Also presented at the First world
congress of the game theory society, July 2000.
- The Home Model
and Competitive Algorithms for Load Balancing in
a Computing Cluster,
by Ron Lavi and Amnon Barak
In the Proceedings of the
21st Intl. Conf. on Distributed Computing Systems (ICDCS'01), April
2001.
- Improving
the PVM Daemon Network Performance by Direct Network Access
by Ron Lavi and Amnon Barak.
In the Proceedings of the 5th EuroPVM/MPI'98,
LNCS 1497, pp. 44-51, Springer-Verlag, 1998.
- My Ph.D. thesis:
Auction Theory in Computational Settings , August 2004.
- My M.Sc. thesis: The
Home Model for Load Balancing in a Computing Cluster , October
1999.