Selected Publications, Working Papers, and Presentations

Show only:  Auctions & Mechanism Design   (Computational) Game Theory   Design & Analysis of Heuristic Algorithms 
Show only: 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999
Show publications ordered by citations:  Google Scholar;  Microsoft Academic Search;  ACM Digital Library

 

2012

  • Behavioral Game-Theoretic Models: A Bayesian Framework For Parameter Analysis. J. Wright, K. Leyton-Brown. Conference on Autonomous Agents and Multiagent Systems (AAMAS), (8 pages), 2012.
    • Preprint: PDF; PS; BIB
  • Parallel Algorithm Configuration. F. Hutter, H.H. Hoos, K. Leyton-Brown. Learning and Intelligent Optimization Conference (LION6), (15 pages), 2012. 

2011

  • Revenue Monotonicity in Deterministic, Dominant-Strategy Combinatorial Auctions.  B. Rastegeri, A. Condon, K. Leyton-Brown. Artificial Intelligence (AIJ), volume 175, issue 2, pp. 441–456, February 2011. This is an extended version of our 2007 AAAI paper.
  • Action-Graph Games.  A.X. Jiang, K. Leyton-Brown, N.A.R. Bhat. Games and Economic Behavior, volume 71, issue 1, pp. 141–173, January 2011.
  • A General Framework for Computing Optimal Correlated Equilibria in Compact Games. A. X. Jiang, K. Leyton-Brown. Workshop on Internet and Network Economics (WINE 2011), 2011.
  • Computing Nash Equilibria of Action-Graph Games via Support Enumeration. D. Thompson, S. Leung, K. Leyton-Brown. Workshop on Internet and Network Economics (WINE 2011), 2011.
  • Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games. A.X. Jiang, K. Leyton-Brown. ACM Electronic Commerce Conference (ACM-EC), 2011. Received the best student paper award. Short version appeared in SIGecom Exchanges, volume 10, number 1, pages 6–8, 2011.
  • Dominant-Strategy Auction Design for Agents with Uncertain, Private Values. D. Thompson, K. Leyton-Brown. Conference of the Association for the Advancement of Artificial Intelligence (AAAI), 2011.
  • Modeling and Monitoring Crop Disease in Developing Countries. J. Quinn, K. Leyton-Brown, E. Mwebaze. Conference of the Association for the Advancement of Artificial Intelligence (AAAI), Computational Sustainability and AI Track, 2011.
  • Sequential Model-Based Optimization for General Algorithm Configuration. F. Hutter, H.H. Hoos, K. Leyton-Brown. Learning and Intelligent OptimizatioN Conference (LION5), January 2011. Received the runner-up best paper award. 
  • HAL: A Framework for the Automated Design and Analysis of High-Performance Algorithms. C. Nell, C. Fawcett, H.H. Hoos, K. Leyton-Brown. Learning and Intelligent OptimizatioN Conference (LION5), 2011.
  • Linear solvers for nonlinear games: using pivoting algorithms to find Nash equilibria in n-player games. James Wright, Albert Xin Jiang, K. Leyton-Brown. SIGecom Exchanges, volume 10, number 1, pages 9–12, 2011.
  • Bayesian Optimization with Censored Resonse Data. Workshop on Bayesian Optimization, Experimental Design, and Bandits, at the Neural Information Processing Systems Conference (NIPS), (4 pages), December 2011.
    • Paper: available soon.
  • Hydra-MIP: Automated Algorithm Configuration and Selection for Mixed Integer Programming. L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown. RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, July 2011.
  • Two-Sided Matching with Partial Information. B. Rastegari, A. Condon, K. Leyton-Brown, N. Immorlica. Working paper.
  • Empirical Hardness Models: A Statistical Approach to Describing Hardness in Practice. K. Leyton-Brown. Presentation at the Workshop on Beyond Worst-Case Analysis at Stanford University, California.
  • Algorithms for Making Good Decisions. K. Leyton-Brown. A nontechnical introduction to my research, presented at Calumet College, York University.
  • Future Directions in Algorithmic Game Theory. Panel: S. Hart, K. Leyton-Brown, S. Micali, E. Tardos, V. Vazirani. At the Workshop on Innovations in Algorithmic Game Theory, Hebrew University, Jerusalem, June 2011.

2010

  • Tradeoffs in the Empirical Evaluation of Competing Algorithm Designs F. Hutter, H.H. Hoos, K. Leyton-Brown.  Annals of Mathematics and Artificial Intelligence (AMAI), Special Issue on Learning and Intelligent Optimization, volume 60, number 1, pp. 65–89, October 2010.
  • Algorithmic Game Theory and Artificial Intelligence. E. Elkind, K. Leyton-Brown. Artificial Intelligence Magazine, volume 31, number 4, pp. 9–12, 2011.
  • Bayesian Action-Graph Games. A. X. Jiang, K. Leyton-Brown. Conference on Neural Information Processing Systems (NIPS), 2010.
  • Computing Pure Strategy Nash Equilibria in Compact Symmetric Games. C. Ryan, A. X. Jiang, K. Leyton-Brown. ACM Conference on Electronic Commerce (ACM-EC), 2010.
  • Beyond Equilibrium: Predicting Human Behavior in Normal Form Games. J. Wright, K. Leyton-Brown. Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010.
  • Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010.
  • Time-Bounded Sequential Parameter Optimization. F. Hutter, H.H. Hoos, K. Leyton-Brown, K. Murphy.  Learning and Intelligent Optimization Conference (LION4), 2010. Received the runner-up best paper award.
  • Automated Configuration of Mixed Integer Programming Solvers. F. Hutter, H.H. Hoos, K. Leyton-Brown. International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR), 2010.
  • Sequential Model-Based Parameter Optimisation: an Experimental Investigation of Automated and Interactive Approaches. F. Hutter, T. Bartz-Beielstein, H.H. Hoos, K. Leyton-Brown, K.P. Murphy. Chapter 15 in Experimental Methods for the Analysis of Optimization Algorithms, T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (editors), pages 361–411. Springer, 2010.
  • Computational Mechanism Analysis: Towards a "CPLEX for Mechanisms". K. Leyton-Brown. Presentation at the inauguration of the Center for Research in the Foundations of Electronic Markets, Aarhus University, Denmark.
    • Slides from CFEM, Aarhus: PDF

2009

 

Multiagent Systems

 

 

Essentials of Game Theory

 

  • SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown. Journal of Artificial Intelligence Research (JAIR), volume 32, pp. 565–606, June 2008. Received the 2010 IJCAI-JAIR Best Paper Prize.
  • Tractable Computational Methods for Finding Nash Equilibria of Perfect-Information Position Auctions. D. Thompson, K. Leyton-Brown. Fourth Workshop on Ad Auctions, ACM Conference on Electronic Commerce (EC'08), 2008.
  • A Bidding Ring Protocol for First-Price Auctions. K. Leyton-Brown, M. Tennenholtz, N.A.R. Bhat, Y. Shoham. Submitted to Journal of Economic Theory, August 2008. Please cite as UBC CS Technical Report TR-2008-10, 2008.
  • Empirically Evaluating Multiagent Learning Algorithms. E. Zawadzki, A. Lipson, K. Leyton-Brown. Working Paper, November 2008.
  • From CATS to SAT: Modeling Empirical Hardness to Understand and Solve Hard Computational Problems.  K. Leyton-Brown. Presentation at 3rd Multiagent Resource Allocation (MARA) Symposium, Amsterdam, 2008.
    • Abstract: PDF
    • Slides from MARA, Amsterdam: PDF

2007

  • Bidding Agents for Online Auctions with Hidden Bids. A. Jiang, K. Leyton-Brown.  Machine Learning Journal,  volume 67, number 1–2, pp. 117–143, May 2007.  A short version was presented with the title Computing Bidders' Valuation Distributions in Online Auctions at the Game Theory and Decision Theory Workshop at the International Conference on Artificial Intelligence (IJCAI-05). 
  • SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT. L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown. Principles and Practice of Constraint Programming (CP), Providence, 2007.
  • Hierarchical Hardness Models for SAT. L. Xu, H.H. Hoos, K. Leyton-Brown. Principles and Practice of Constraint Programming (CP), Providence, 2007.
  • Computing Pure Nash Equilibria in Symmetric Action Graph Games. A. Jiang, K. Leyton-Brown. Association for the Advancement of Artificial Intelligence (AAAI), Vancouver, 2007.
  • Valuation Uncertainty and Imperfect Introspection in Second-Price Auctions. D. Thompson, K. Leyton-Brown. Association for the Advancement of Artificial Intelligence (AAAI), Vancouver, 2007.
    • Paper: PDF; PS; BIB
    • Slides from DIMACS Workshop on Auctions with Transaction Costs, Rutgers (by Dave Thompson): PDF
  • Revenue Monotonicity in Combinatorial Auctions. B. Rastegari, A. Condon, K. Leyton-Brown. Association for the Advancement of Artificial Intelligence (AAAI), Vancouver, 2007.
    • Paper: PDF; PS; BIB
    • Slides from Computational Social Systems and the Internet, Dagstuhl, 2007: PDF
  • Empirically Testing Decision Making in TAC SCM. E. Zawadzki, K. Leyton-Brown. AAAI-07 Workshop on Trading Agent Design and Analysis (TADA-07), Vancouver, 2007.
  • A Tutorial on the Proof of the Existence of Nash Equilibria. A. Jiang and K. Leyton-Brown. UBC CS Technical Report TR-2007-25, 2007.

2006

2005

2004

  • Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.  E. Nudelman,  K. Leyton-Brown, H.H. Hoos, A. Devkar, Y. Shoham.  Principles and Practice of Constraint Programming (CP-04), Toronto, 2004.
  • Computing Nash Equilibria of Action-Graph Games. N. Bhat, K. Leyton-Brown.  Uncertainty in Artificial Intelligence (UAI-2004), Banff, 2004.  Short versions the World Congress on Game Theory (Games 2004) and the Stony Brook Game Theory Conference, 2004.
  • Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.  E. Nudelman, J. Wortman, Y. Shoham and K. Leyton-Brown.  International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-04), New York, 2004.  Short versions appeared at the World Congress on Game Theory (Games 2004) and the Stony Brook Game Theory Conference, 2004.
  • SATzilla: An Algorithm Portfolio for SAT.  E. Nudelman, A. Devkar, Y. Shoham, K. Leyton-Brown, H.H. Hoos.  International Conference on Satisfiability Testing (SAT-2004) (short paper, unrefereed), Vancouver, 2004.  Presented at the International Symposium on Artificial Intelligence and Mathematics (AI+Math 2004).

2003

  • Resource Allocation in Competitive Multiagent Systems, K. Leyton-Brown.  Ph.D. thesis, Stanford University.  Contains updated versions of most of my work to this date; in particular, much of the work on combinatorial auctions is significantly updated and not available anywhere else.
  • Local-Effect Games.  K. Leyton-Brown, M. Tennenholtz. International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, 2003.  Also presented at the Eighth International Symposium on Artificial Intelligence and Mathematics (AI+Math 2004).
  • A Portfolio Approach to Algorithm Selection.  K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, Y. Shoham.  International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, 2003.
  • Boosting as a Metaphor for Algorithm Design.  K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, Y. Shoham. Principles and Practice of Constraint Programming (CP-03), Cork, 2003. This is a companion paper to the IJCAI paper above.

2002

  • Learning the Empirical Hardness of Optimization Problems: the case of combinatorial auctions.  K. Leyton-Brown, E. Nudelman, Y. Shoham.  Principles and Practice of Constraint Programming (CP-02), Ithaca, 2002. It was also presented at Electronic Market Design, 2002.
  • Bidding Clubs in First-Price Auctions: K. Leyton-Brown, Y. Shoham, M. Tennenholtz.  American Association for Artificial Intelligence (AAAI-02), Edmonton, 2002.
  • Incentive Mechanisms for Smoothing Out a Focused Demand for Network Resources: K. Leyton-Brown, R. Porter, S. Venkataraman, B. Prabhakar.  ACM Computer Communications Review, volume 26, pp. 237–250, 2002.  A short version appeared in the ACM Conference on Electronic Commerce (EC'01) with the title Smoothing Out Focused Demand for Network Resources; the work was also presented at ITCom 2001. 
  • Response to Milgrom and Ausubel's Comments on the Second Wye River Package Bidding Conference. K. Leyton-Brown. Published on the Federal Communication Commission's Combinatorial Bidding Conference 2001 website, January 2002.
    • Paper: PDF; PS; BIB
    • Milgrom and Ausubel's Comments on the Second Wye River Package Bidding Conference: PDF
    • FCC's Combinatorial Bidding Conference 2001 website: Link

2001

  • Incentives for Sharing in Peer-to-Peer Networks: P. Golle, K. Leyton-Brown, I. Mironov, M. Lillibridge.  The full version appeared in Workshop on Electronic Commerce (WELCOM'01), Heidelberg, 2001.  The short version appeared in ACM Conference on Electronic Commerce (EC'01), Tampa, 2001.
  • Smoothing Out Focused Demand for Network Resources. K. Leyton-Brown, R. Porter, S. Venkataraman, B. Prabhakar.  ACM Conference on Electronic Commerce (EC'01), Tampa, 2001. 
  • Auctions, Auction Theory, and Hard Computational Problems in Auctions.  Presentation at Cornell workshop on computational hardness and auctions, June 2001.  Most of this talk was adapted from slides by Shoham, Tennenholtz and Wellman.
    • Slides from Cornell workshop: PDF

2000

1999