Research Interests:
Computational economics. Electronic commerce. Algorithmic mechanism design. Tradeoffs between computational and economic
constraints.
Game Theory. Auction
theory. Microeconomic theory.
Social choice.
Web-based advertising. Sponsored-search
auctions. Structure, externalities and dynamics in social systems.
Education:
PhD in computer
science, The Hebrew University, 2006.
o
Title:”Information and Communication in
Mechanism Design”.
M.Sc. in Computer Science, The
Hebrew University. (Advisor: Noam Nisan)
B.Sc. (The Hebrew University) in:
o
Computer Science.
o
Economics.
o
“Amirim” special honors
program in natural sciences.
Academic service:
Tutorial
at EC’08 (ACM Conference on Electronic Commerce) on “Communication
Requirements of Economic Mechanism”, together with Ilya Segal.
July 9th, 8:30-12:00, Room 150, Wieboldt Hall, Northwestern, Chicago.
Program committee: EC’08,
AAMAS’08,
AAAI’08
Teaching:
Interdisciplinary
courses (economics, business, etc.):
Game
Theory. Special
program in Economics, Philosophy and Political Science.
Instructor (undergraduate). The Hebrew University (2006).
Internet
Entrepreneurship Course. An industry-oriented course where
computer-science and business students build together start-up companies
from scratch.
TA (graduate). The Hebrew University
(two academic years, 2000-2002).
Computer science theory (and applied theory):
Foundations of Electronic Commerce.
State-of-the-art results in computational economics (algorithmic mechanism
design, selfish routing, auction theory).
Instructor (graduate). IDC, Herzlia
(Spring, 2005).
Theory
of computation.
TA (undergraduate). The Hebrew
University (spring 2004).
Computer science applications:
Programming
Laboratory course. Intensive programming experience
in C and C++.
TA (undergraduate). The Hebrew
University (fall, 2002).
Object-Oriented programming and Software Engineering.
Instructor, Sela College (1998).
Publications:
Book
chapters and journals:
Combinatorial Auctions, by Liad Blumrosen and Noam Nisan.
Chapter 11 in the book "Algorithmic
Game Theory".
Editors: Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani.
Cambridge University Press, 2007.
o
[pdf]
Welfare Maximization in
Congestion Games, by Liad Blumrosen and Shahar Dobzinski.
IEEE Journal on Selected Areas in Communications (JSAC), special
issue: Non-Cooperative Behavior in Networking. 25(6):1224-1236.
o
[pdf]
Computationally-Feasible
Truthful Auctions for Convex Bundles,
by Moshe Babaioff
and Liad Blumrosen.
Games and Economic Behavior (GEB), to appear.
o
[pdf]
Auctions with Severely Bounded
Communication, by Liad Blumrosen, Noam Nisan and Ilya Segal. Journal of Artificial
Intelligence Research (JAIR), 28:233-266.
o
[pdf]
Working papers:
Position Auctions with
Non-Uniform Conversion Rates,
by Liad Blumrosen, Jason
Hartline and Shuzhen Nong (2007).
A preliminary version presented in the Dagstuhl workshop Computational
Social Systems and the Internet 2007, and in the Stony Brook Game
Theory Festival 2007.
To appear in the 4th
Workshop on ad auctions (July, 2008).
Informational Limitations of
Ascending Combinatorial Auctions,
by Liad Blumrosen and Noam Nisan
(2006). Contains results from the EC'05 paper, with more new results.
Submitted to Journal Publication.
o
[pdf]
On
the Computational Power of Demand Queries,
by Liad Blumrosen and Noam Nisan
(2006). Subsumes the EC’05 paper on demand queries. Submitted
for journal publication.
o
[pdf]
Mechanism Design with a
Restricted Action Space, by Liad
Blumrosen and Michal Feldman. Subsumes the EC’06 paper. Submitted
for journal publication.
o
[pdf]
Conference papers:
Posted prices vs. Negotiation: an asymptotic analysis, by Liad Blumrosen and Thomas Holenstein
(2007).
The
9th ACM conference on Electronic Commerce (EC’08).
o [pdf]
The
informational overhead of incentive compatibility, by Moshe
Babaioff, Liad Blumrosen, Moni Naor and Michael Schapira (2007).
The
9th ACM conference on Electronic Commerce (EC’08).
o
[pdf]
Implementing the Maximum of
Monotone Algorithms, by Liad
Blumrosen.
The 22nd Conference on Artificial Intelligence (AAAI'07).
Short paper appeared in (AAMAS'07).
o
[pdf]
Implementation with a Bounded
Action Space, by Liad Blumrosen and Michal Feldman.
The 7th ACM Conference on Electronic Commerce (EC'06).
o
Proceeding
version [pdf]
o
Full
version [pdf]
Welfare Maximization in
Congestion Games, by Liad Blumrosen and Shahar Dobzinski.
The 7th ACM Conference on Electronic Commerce (EC'06).
o
[pdf]
On the Computational Power of
Iterative Auctions I: Demand Queries,
by Liad Blumrosen and Noam Nisan.
The sixth ACM Conference on Electronic Commerce (EC'05).
o
An
extended abstract contained parts I and II (both were accepted). [pdf]
o
Full
paper (discussion paper no. 381, center of rationality, The Hebrew
University): [pdf]
On the Computational Power of
Iterative Auctions II: Ascending Auctions,
by Liad Blumrosen and Noam Nisan.
The sixth ACM Conference on Electronic Commerce (EC'05)
o
Full
paper (discussion paper no. 382, center of rationality, The Hebrew
University): [pdf]
Computationally Feasible
Auctions for Convex Bundles,
by Moshe Babaioff and
Liad Blumrosen.
The 7th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX+RANDOM'04).
o
[pdf]
|
