2009 |
15 | EE | Rica Gonen,
Elan Pavlov:
Adaptive Incentive-Compatible Sponsored Search Auction.
SOFSEM 2009: 303-316 |
2008 |
14 | EE | Rica Gonen:
On the Hardness of Truthful Online Auctions with Multidimensional Constraints.
CiE 2008: 221-230 |
13 | EE | Rica Gonen,
Sergei Vassilvitskii:
Sponsored Search Auctions with Reserve Prices: Going Beyond Separability.
WINE 2008: 597-608 |
2007 |
12 | EE | Mira Gonen,
Rica Gonen,
Elan Pavlov:
Generalized trade reduction mechanisms.
ACM Conference on Electronic Commerce 2007: 20-29 |
11 | EE | Rica Gonen,
Elan Pavlov:
An incentive-compatible multi-armed bandit mechanism.
PODC 2007: 362-363 |
10 | EE | Rica Gonen,
Elan Pavlov:
An Adaptive Sponsored Search Mechanism delta -Gain Truthful in Valuation, Time, and Budget.
WINE 2007: 341-346 |
9 | EE | Mira Gonen,
Rica Gonen,
Elan Pavlov:
Characterizing Truthful Market Design.
WINE 2007: 590-595 |
8 | EE | Yiling Chen,
Daniel M. Reeves,
David M. Pennock,
Robin D. Hanson,
Lance Fortnow,
Rica Gonen:
Bluffing and Strategic Reticence in Prediction Markets.
WINE 2007: 70-81 |
2006 |
7 | EE | Ittai Abraham,
Danny Dolev,
Rica Gonen,
Joseph Y. Halpern:
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation.
PODC 2006: 53-62 |
2004 |
6 | EE | Yair Bartal,
Rica Gonen,
Pierfrancesco La Mura:
Negotiation-range mechanisms: exploring the limits of truthful efficient markets.
ACM Conference on Electronic Commerce 2004: 1-8 |
5 | EE | Rica Gonen:
Negotiation-Range Mechanisms: Coalition-Resistant Markets.
ESA 2004: 383-394 |
2003 |
4 | EE | Yair Bartal,
Rica Gonen,
Noam Nisan:
Incentive compatible multi unit combinatorial auctions.
TARK 2003: 72-87 |
2002 |
3 | EE | Rica Gonen,
Daniel J. Lehmann:
Linear Programming helps solving large multi-unit combinatorial auctions
CoRR cs.GT/0202016: (2002) |
2 | EE | Rica Gonen,
Daniel J. Lehmann:
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
CoRR cs.GT/0202032: (2002) |
2000 |
1 | EE | Rica Gonen,
Daniel J. Lehmann:
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics.
ACM Conference on Electronic Commerce 2000: 13-20 |