 | 2009 |
| 26 |  | Moshe Babaioff,
Jason D. Hartline,
Robert D. Kleinberg:
Selling ad campaigns: online algorithms with cancellations.
ACM Conference on Electronic Commerce 2009: 61-70 |
| 25 |  | Moshe Babaioff,
Yogeshwer Sharma,
Aleksandrs Slivkins:
Characterizing truthful multi-armed bandit mechanisms: extended abstract.
ACM Conference on Electronic Commerce 2009: 79-88 |
| 24 |  | Moshe Babaioff,
Michal Feldman,
Noam Nisan:
Free-Riding and Free-Labor in Combinatorial Agency.
SAGT 2009: 109-121 |
| 23 |  | Moshe Babaioff,
Michael Dinitz,
Anupam Gupta,
Nicole Immorlica,
Kunal Talwar:
Secretary problems: weights and discounts.
SODA 2009: 1245-1254 |
| 22 |  | Moshe Babaioff,
Liad Blumrosen,
Aaron Roth:
Auctions with Online Supply
CoRR abs/0905.3429: (2009) |
| 21 |  | Moshe Babaioff,
Ron Lavi,
Elan Pavlov:
Single-value combinatorial auctions and algorithmic implementation in undominated strategies.
J. ACM 56(1): (2009) |
| 2008 |
| 20 |  | Moshe Babaioff,
Liad Blumrosen,
Moni Naor,
Michael Schapira:
Informational overhead of incentive compatibility.
ACM Conference on Electronic Commerce 2008: 88-97 |
| 19 |  | Moshe Babaioff,
Patrick Briest,
Piotr Krysta:
On the Approximability of Combinatorial Exchange Problems.
SAGT 2008: 83-94 |
| 18 |  | Moshe Babaioff:
Truthful Mechanisms for One-Parameter Agents.
Encyclopedia of Algorithms 2008 |
| 17 |  | Moshe Babaioff,
Yogeshwer Sharma,
Aleksandrs Slivkins:
Characterizing Truthful Multi-Armed Bandit Mechanisms
CoRR abs/0812.2291: (2008) |
| 16 |  | Moshe Babaioff,
Nicole Immorlica,
David Kempe,
Robert Kleinberg:
Online auctions and generalized secretary problems.
SIGecom Exchanges 7(2): (2008) |
| 2007 |
| 15 |  | Moshe Babaioff,
Robert Kleinberg,
Christos H. Papadimitriou:
Congestion games with malicious players.
ACM Conference on Electronic Commerce 2007: 103-112 |
| 14 |  | Moshe Babaioff,
Nicole Immorlica,
David Kempe,
Robert Kleinberg:
A Knapsack Secretary Problem with Applications.
APPROX-RANDOM 2007: 16-28 |
| 13 |  | Moshe Babaioff,
John Chuang:
On the Optimality and Interconnection of Valiant Load-Balancing Networks.
INFOCOM 2007: 80-88 |
| 12 |  | Moshe Babaioff,
Nicole Immorlica,
Robert Kleinberg:
Matroids, secretary problems, and online mechanisms.
SODA 2007: 434-443 |
| 2006 |
| 11 |  | Moshe Babaioff,
Ron Lavi,
Elan Pavlov:
Impersonation-Based Mechanisms.
AAAI 2006 |
| 10 |  | Moshe Babaioff,
Michal Feldman,
Noam Nisan:
Combinatorial agency.
ACM Conference on Electronic Commerce 2006: 18-28 |
| 9 |  | Moshe Babaioff,
Ron Lavi,
Elan Pavlov:
Single-value combinatorial auctions and implementation in undominated strategies.
SODA 2006: 1054-1063 |
| 8 |  | Moshe Babaioff,
Michal Feldman,
Noam Nisan:
Mixed Strategies in Combinatorial Agency.
WINE 2006: 353-364 |
| 2005 |
| 7 |  | Moshe Babaioff,
Ron Lavi,
Elan Pavlov:
Mechanism Design for Single-Value Domains.
AAAI 2005: 241-247 |
| 6 |  | Moshe Babaioff,
William E. Walsh:
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation.
Decision Support Systems 39(1): 123-149 (2005) |
| 2004 |
| 5 |  | Moshe Babaioff,
Noam Nisan,
Elan Pavlov:
Mechanisms for a spatially distributed market.
ACM Conference on Electronic Commerce 2004: 9-20 |
| 4 |  | Moshe Babaioff,
Liad Blumrosen:
Computationally-Feasible Truthful Auctions for Convex Bundles.
APPROX-RANDOM 2004: 27-38 |
| 3 |  | Moshe Babaioff,
Noam Nisan:
Concurrent Auctions Across The Supply Chain.
J. Artif. Intell. Res. (JAIR) 21: 595-629 (2004) |
| 2003 |
| 2 |  | Moshe Babaioff,
William E. Walsh:
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation.
ACM Conference on Electronic Commerce 2003: 64-75 |
| 2001 |
| 1 |  | Moshe Babaioff,
Noam Nisan:
Concurrent auctions across the supply chain.
ACM Conference on Electronic Commerce 2001: 1-10 |