| 2008 |
|---|
| 11 | EE | Richard Cole,
Shahar Dobzinski,
Lisa Fleischer:
Prompt Mechanisms for Online Auctions.
SAGT 2008: 170-181 |
| 10 | EE | Shahar Dobzinski,
Aranyak Mehta,
Tim Roughgarden,
Mukund Sundararajan:
Is Shapley Cost Sharing Optimal?
SAGT 2008: 327-336 |
| 2007 |
|---|
| 9 | EE | Shahar Dobzinski,
Noam Nisan:
Mechanisms for multi-unit auctions.
ACM Conference on Electronic Commerce 2007: 346-351 |
| 8 | EE | Shahar Dobzinski:
Two Randomized Mechanisms for Combinatorial Auctions.
APPROX-RANDOM 2007: 89-103 |
| 7 | EE | Shahar Dobzinski,
Noam Nisan:
Limitations of VCG-based mechanisms.
STOC 2007: 338-344 |
| 6 | EE | Liad Blumrosen,
Shahar Dobzinski:
Welfare Maximization in Congestion Games.
IEEE Journal on Selected Areas in Communications 25(6): 1224-1236 (2007) |
| 5 | EE | Shahar Dobzinski:
Better mechanisms for combinatorial auctions via maximal-in-range algorithms?
SIGecom Exchanges 7(1): 30-33 (2007) |
| 2006 |
|---|
| 4 | EE | Liad Blumrosen,
Shahar Dobzinski:
Welfare maximization in congestion games.
ACM Conference on Electronic Commerce 2006: 52-61 |
| 3 | EE | Shahar Dobzinski,
Michael Schapira:
An improved approximation algorithm for combinatorial auctions with submodular bidders.
SODA 2006: 1064-1073 |
| 2 | EE | Shahar Dobzinski,
Noam Nisan,
Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions.
STOC 2006: 644-652 |
| 2005 |
|---|
| 1 | EE | Shahar Dobzinski,
Noam Nisan,
Michael Schapira:
Approximation algorithms for combinatorial auctions with complement-free bidders.
STOC 2005: 610-618 |
