2009 |
30 | EE | Baharak Rastegari,
Anne Condon,
Kevin Leyton-Brown:
Stepwise randomized combinatorial auctions achieve revenue monotonicity.
SODA 2009: 738-747 |
2007 |
29 | | Baharak Rastegari,
Anne Condon,
Kevin Leyton-Brown:
Revenue Monotonicity in Combinatorial Auctions.
AAAI 2007: 122-127 |
28 | | David R. M. Thompson,
Kevin Leyton-Brown:
Valuation Uncertainty and Imperfect Introspection in Second-Price Auctions.
AAAI 2007: 148-153 |
27 | | Albert Xin Jiang,
Kevin Leyton-Brown:
Computing Pure Nash Equilibria in Symmetric Action Graph Games.
AAAI 2007: 79-85 |
26 | EE | Lin Xu,
Holger H. Hoos,
Kevin Leyton-Brown:
Hierarchical Hardness Models for SAT.
CP 2007: 696-711 |
25 | EE | Lin Xu,
Frank Hutter,
Holger H. Hoos,
Kevin Leyton-Brown:
: The Design and Analysis of an Algorithm Portfolio for SAT.
CP 2007: 712-727 |
24 | EE | Albert Xin Jiang,
Kevin Leyton-Brown:
Bidding agents for online auctions with hidden bids.
Machine Learning 67(1-2): 117-143 (2007) |
23 | EE | Baharak Rastegari,
Anne Condon,
Kevin Leyton-Brown:
Revenue monotonicity in combinatorial auctions.
SIGecom Exchanges 7(1): 45-47 (2007) |
2006 |
22 | | Albert Xin Jiang,
Kevin Leyton-Brown:
A Polynomial-Time Algorithm for Action Graph Games.
AAAI 2006 |
21 | EE | Frank Hutter,
Youssef Hamadi,
Holger H. Hoos,
Kevin Leyton-Brown:
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms.
CP 2006: 213-228 |
2005 |
20 | EE | Kevin Leyton-Brown,
Navin A. R. Bhat:
Computing Nash Equilibria of Action-Graph Games.
Computing and Markets 2005 |
19 | EE | Kevin Leyton-Brown,
Moshe Tennenholtz:
Local-Effect Games.
Computing and Markets 2005 |
2004 |
18 | EE | Eugene Nudelman,
Jennifer Wortman,
Yoav Shoham,
Kevin Leyton-Brown:
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.
AAMAS 2004: 880-887 |
17 | EE | Eugene Nudelman,
Kevin Leyton-Brown,
Holger H. Hoos,
Alex Devkar,
Yoav Shoham:
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.
CP 2004: 438-452 |
16 | EE | Navin A. R. Bhat,
Kevin Leyton-Brown:
Computing Nash Equilibria of Action-Graph Games.
UAI 2004: 35-42 |
2003 |
15 | EE | Kevin Leyton-Brown,
Eugene Nudelman,
Galen Andrew,
Jim McFadden,
Yoav Shoham:
Boosting as a Metaphor for Algorithm Design.
CP 2003: 899-903 |
14 | | Kevin Leyton-Brown,
Eugene Nudelman,
Galen Andrew,
Jim McFadden,
Yoav Shoham:
A Portfolio Approach to Algorithm Selection.
IJCAI 2003: 1542-1542 |
13 | | Kevin Leyton-Brown,
Moshe Tennenholtz:
Local-Effect Games.
IJCAI 2003: 772-780 |
12 | EE | Kevin Leyton-Brown,
Ryan Porter,
Balaji Prabhakar,
Yoav Shoham,
Shobha Venkataraman:
Incentive mechanisms for smoothing out a focused demand for network resources.
Computer Communications 26(3): 237-250 (2003) |
11 | EE | Kevin Leyton-Brown,
Robert McGrew,
Ryan Porter:
Conference report: the fourth ACM conference on electronic commerce.
SIGecom Exchanges 4(2): 41-46 (2003) |
2002 |
10 | | Kevin Leyton-Brown,
Yoav Shoham,
Moshe Tennenholtz:
Bidding Clubs in First-Price Auctions.
AAAI/IAAI 2002: 373-378 |
9 | EE | Kevin Leyton-Brown,
Eugene Nudelman,
Yoav Shoham:
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.
CP 2002: 556-572 |
8 | EE | Kevin Leyton-Brown,
Yoav Shoham,
Moshe Tennenholtz:
Bidding Clubs in First-Price Auctions
CoRR cs.GT/0201017: (2002) |
2001 |
7 | EE | Kevin Leyton-Brown,
Ryan Porter,
Shobha Venkataraman,
Balaji Prabhakar:
Smoothing out focused demand for network resources.
ACM Conference on Electronic Commerce 2001: 245-248 |
6 | EE | Philippe Golle,
Kevin Leyton-Brown,
Ilya Mironov:
Incentives for sharing in peer-to-peer networks.
ACM Conference on Electronic Commerce 2001: 264-267 |
5 | EE | Philippe Golle,
Kevin Leyton-Brown,
Ilya Mironov,
Mark Lillibridge:
Incentives for Sharing in Peer-to-Peer Networks.
WELCOM 2001: 75-87 |
2000 |
4 | | Kevin Leyton-Brown,
Yoav Shoham,
Moshe Tennenholtz:
An Algorithm for Multi-Unit Combinatorial Auctions.
AAAI/IAAI 2000: 56-61 |
3 | EE | Kevin Leyton-Brown,
Yoav Shoham,
Moshe Tennenholtz:
Bidding clubs: institutionalized collusion in auctions.
ACM Conference on Electronic Commerce 2000: 253-259 |
2 | EE | Kevin Leyton-Brown,
Mark Pearson,
Yoav Shoham:
Towards a universal test suite for combinatorial auction algorithms.
ACM Conference on Electronic Commerce 2000: 66-76 |
1999 |
1 | | Yuzo Fujishima,
Kevin Leyton-Brown,
Yoav Shoham:
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches.
IJCAI 1999: 548-553 |