 | 2008 |
|---|
| 16 |       | Oren Ben-Zwi,
Amir Ronen:
The Local and Global Price of Anarchy of Graphical Games.
SAGT 2008: 255-266 |
| 15 | | Ryan Porter,
Amir Ronen,
Yoav Shoham,
Moshe Tennenholtz:
Fault tolerant mechanism design.
Artif. Intell. 172(15): 1783-1799 (2008) |
| 2007 |
|---|
| 14 | | Noam Nisan,
Amir Ronen:
Computationally Feasible VCG Mechanisms.
J. Artif. Intell. Res. (JAIR) 29: 19-47 (2007) |
| 2005 |
|---|
| 13 | | Amir Ronen,
Daniel J. Lehmann:
Nearly optimal multi attribute auctions.
ACM Conference on Electronic Commerce 2005: 279-285 |
| 12 | | Amir Ronen,
Rina Talisman:
Towards Generic Low Payment Mechanisms for Decentralized Task Allocation: A Learning Based Approach.
CEC 2005: 126-133 |
| 11 | | Amir Ronen,
Lyron Wahrmann:
Prediction Games.
WINE 2005: 129-140 |
| 2004 |
|---|
| 10 | | Artur Czumaj,
Amir Ronen:
On the expected payment of mechanisms for task allocation: [extended abstract].
ACM Conference on Electronic Commerce 2004: 252-253 |
| 9 | | Artur Czumaj,
Amir Ronen:
On the expected payment of mechanisms for task allocation.
PODC 2004: 98-106 |
| 2002 |
|---|
| 8 | | Amir Ronen,
Amin Saberi:
On the Hardness of Optimal Auctions.
FOCS 2002: 396-405 |
| 7 |  | Ryan Porter,
Amir Ronen,
Yoav Shoham,
Moshe Tennenholtz:
Mechanism Design with Execution Uncertainty.
UAI 2002: 414-421 |
| 2001 |
|---|
| 6 | | Amir Ronen:
Mechanism design with incomplete languages.
ACM Conference on Electronic Commerce 2001: 105-114 |
| 5 | | Amir Ronen:
On approximating optimal auctions.
ACM Conference on Electronic Commerce 2001: 11-17 |
| 2000 |
|---|
| 4 | | Noam Nisan,
Amir Ronen:
Computationally feasible VCG mechanisms.
ACM Conference on Electronic Commerce 2000: 242-252 |
| 3 | | Amir Ronen:
Algorithms for Rational Agents.
SOFSEM 2000: 56-70 |
| 1999 |
|---|
| 2 | | Noam Nisan,
Amir Ronen:
Algorithmic Mechanism Design (Extended Abstract).
STOC 1999: 129-140 |
| 1997 |
|---|
| 1 | | Gad Aharoni,
Amnon Barak,
Amir Ronen:
A Competitive Algorithm for Managing Sharing in the Distributed Execution of Functional Programs.
J. Funct. Program. 7(4): 421-440 (1997) |
