 | 2009 |
|---|
| 14 |       | Moshe Babaioff,
Liad Blumrosen,
Aaron Roth:
Auctions with Online Supply
CoRR abs/0905.3429: (2009) |
| 2008 |
|---|
| 13 | | Liad Blumrosen,
Thomas Holenstein:
Posted prices vs. negotiations: an asymptotic analysis.
ACM Conference on Electronic Commerce 2008: 49 |
| 12 | | Moshe Babaioff,
Liad Blumrosen,
Moni Naor,
Michael Schapira:
Informational overhead of incentive compatibility.
ACM Conference on Electronic Commerce 2008: 88-97 |
| 2007 |
|---|
| 11 |  | Liad Blumrosen:
Implementing the Maximum of Monotone Algorithms.
AAAI 2007: 30-35 |
| 10 | | Liad Blumrosen:
Implementing the maximum of monotone algorithms.
AAMAS 2007: 82 |
| 9 | | Liad Blumrosen,
Shahar Dobzinski:
Welfare Maximization in Congestion Games.
IEEE Journal on Selected Areas in Communications 25(6): 1224-1236 (2007) |
| 8 | | Liad Blumrosen,
Noam Nisan,
Ilya Segal:
Auctions with Severely Bounded Communication.
J. Artif. Intell. Res. (JAIR) 28: 233-266 (2007) |
| 2006 |
|---|
| 7 | | Liad Blumrosen,
Shahar Dobzinski:
Welfare maximization in congestion games.
ACM Conference on Electronic Commerce 2006: 52-61 |
| 6 | | Liad Blumrosen,
Michal Feldman:
Implementation with a bounded action space.
ACM Conference on Electronic Commerce 2006: 62-71 |
| 2005 |
|---|
| 5 | | Liad Blumrosen,
Noam Nisan:
On the computational power of iterative auctions.
ACM Conference on Electronic Commerce 2005: 29-43 |
| 2004 |
|---|
| 4 | | Moshe Babaioff,
Liad Blumrosen:
Computationally-Feasible Truthful Auctions for Convex Bundles.
APPROX-RANDOM 2004: 27-38 |
| 2003 |
|---|
| 3 | | Liad Blumrosen,
Noam Nisan,
Ilya Segal:
Multi-player and Multi-round Auctions with Severely Bounded Communication.
ESA 2003: 102-113 |
| 2002 |
|---|
| 2 | | Liad Blumrosen,
Noam Nisan:
Auctions with Severely Bounded Communication.
FOCS 2002: 406-415 |
| 2001 |
|---|
| 1 | | Lior Levy,
Liad Blumrosen,
Noam Nisan:
On-Line Markets for Distributed Object Services: The MAJIC System.
USITS 2001: 85-96 |
