Selected Publications, Working Papers, and Presentations

Show:  Auctions & Mechanism Design   (Computational) Game Theory  Machine Learning  Heuristic Algorithms 
Show: 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003
2002 2001 2000 1999
Show publications ordered by citations:  Google Scholar Semantic Scholar; ACM Digital Library 

 

2017

  • Computational Analysis of Perfect-Information Position Auctions. D. Thompson, K. Leyton-Brown. Games and Economic Behavior (GEB), to appear, 2017.
  • Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates. K. Eggensperger, M. Lindauer, H. Hoos, F. Hutter, K. Leyton-Brown. Machine Learning Journal (MLJ), to appear, 2017.
  • Auto-WEKA 2.0: Automatic model and hyperparameter selection in WEKA. L. Kotthoff, C. Thornton, F. Hutter, H. Hoos, K. Leyton-Brown. Journal of Machine Learning Research (JMLR), open-source software track, to appear, 2017.
  • Automatic Construction of Parallel Portfolios via Algorithm Configuration. M. Lindauer, H. Hoos, K. Leyton-Brown, T. Schaub. Artificial Intelligence Journal (AIJ), volume 244, pp. 272–290, March 2017.
  • The Configurable SAT Solver Challenge (CSSC). F. Hutter, M. Lindauer, A. Balint, S. Bayless, H. Hoos, K. Leyton-Brown. Artificial Intelligence Journal (AIJ), volume 243, pp. 1–25, February 2017.
  • The Positronic Economist: A Computational System for Analyzing Economic Mechanisms. D. Thompson, N. Newman, K. Leyton-Brown. Conference on Artificial Intelligence (AAAI), 2017.
  • Resource Graph Games: A Compact Representation for Games with Structured Strategy Spaces. A. Jiang,
    H. Chan, K. Leyton-Brown. Conference on Artificial Intelligence (AAAI), 2017.

2016

  • SATenstein: Automatically Building Local Search SAT Solvers from Components. A. KhudaBukhsh, L. Xu, H. Hoos, K. Leyton-Brown. Artificial Intelligence Journal (AIJ), volume 232, pp. 20–42, March 2016.
    • Preprint: PDF
    • Official version: DOI
  • ASlib: A Benchmark Library for Algorithm Selection. B. Bischl, P. Kerschke, L. Kotthoff, M. Lindauer, Y. Malitsky, A. Fréchette, H. Hoos, F. Hutter, K. Leyton-Brown, K. Tierney, J. Vanschoren. Artificial Intelligence Journal (AIJ), volume 237, pp. 41–58, August 2016.
  • Deep Learning for Predicting Human Strategic Behavior. J. Hartford, J. Wright, K. Leyton-Brown. Oral presentation at Conference on Neural Information Processing Systems (NIPS), 2016.
  • Multilinear Games. H. Chan, A. Jiang, K. Leyton-Brown, R. Mehta. Conference on Web and Internet Economics (WINE), 2016.
    • Paper (published version): PDF
    • Paper (long version): PDF
  • Solving the Station Repacking Problem. A. Fréchette, N. Newman, K. Leyton-Brown. Conference on Artificial Intelligence (AAAI), 2016.
  • Using the Shapley Value to Analyze Algorithm Portfolios. A. Fréchette, L. Kotthoff, T. Rahwan, H. Hoos, K. Leyton-Brown, T. Michalak. Conference on Artificial Intelligence (AAAI), 2016.
  • Bias in Algorithm Portfolio Performance Evaluation. C. Cameron, H. Hoos, K. Leyton-Brown. International Joint Conference on Artificial Intelligence (IJCAI), 2016.
  • Quantifying the Similarity of Algorithm Configurations. L. Xu, A. Khudabukhsh, H. Hoos, K. Leyton-Brown. Learning and Intelligent Optimization Conference (LION10), 2016.
  • Deep Counterfactual Prediction using Instrumental Variables. J. Hartford, G. Lewis, K. Leyton-Brown, M. Taddy. Workshop on Inference and Learning of Hypothetical and Counterfactual Interventions in Complex Systems at the Conference on Neural Information Processing Systems (NIPS), 2016.
  • Incentivizing Evaluation via Limited Access to Ground Truth: Peer-Prediction Makes Things Worse. X. A. Gao, J. R. Wright, K. Leyton-Brown. Workshop on Algorithmic Game Theory and Data Science at the 17th ACM Conference on Electronic Commerce, 2016.
  • Understanding the Empirical Hardness of NP-Hard Problems. K. Leyton-Brown. Talk at Simons Institute for the Theory of Computing, Berkeley, Boot Camp on Algorithms and Uncertainty, August 2016.
    • Part I (empirical hardness models): YouTube
    • Part II (applications to algorithm configuration and selection): YouTube
  • The Incentive Auction: a Practical Success Story for Policy Impact of AI. K. Leyton-Brown. Talk at Technology Policy Institute Panel on Economic and Policy Implications of AI, National Press Club, Washington DC.

2015

  • Mechanical TA: Partially Automated High-Stakes Peer Grading. J. Wright, C. Thornton, K. Leyton-Brown. ACM Technical Symposium on Computer Science Education (ACM-SIGCSE), 2015
  • Efficient Benchmarking of Hyperparameter Optimizers via Surrogates. K. Eggensperger, F. Hutter, H. Hoos, K. Leyton-Brown. Conference on Artificial Intelligence (AAAI), 2015.
  • Algorithm Runtime Prediction: Methods & Evaluation (Extended Abstract). F. Hutter, L. Xu, H. Hoos, K. Leyton-Brown. International Joint Conference on Artificial Intelligence (IJCAI) Journal Track, 2015. This is an extended abstract of our journal paper, published in a special track at IJCAI on papers that recently appeared in AIJ without having previously appeared as conference publications. It was competitively peer reviewed for IJCAI.

2014

  • Understanding the Empirical Hardness of NP-Complete Problems. K. Leyton-Brown, H. Hoos, F. Hutter, L. Xu. Communications of the Association for Computing Machinery (CACM), volume 57, issue 5, pp. 98–107, May 2014.
    • Preprint: PDF
    • Official version: DOI
  • Algorithm Runtime Prediction: Methods and Evaluation. F. Hutter, L. Xu, H. Hoos, K. Leyton-Brown. Artificial Intelligence (AIJ), volume 206, pp. 79–111, January 2014.
    • Preprint: PDF
    • Official version: DOI
  • Level-0 Meta-Models for Predicting Human Behavior in Games. J. Wright, K. Leyton-Brown. ACM Conference on Economics and Computation (ACM-EC), 2014.
  • Reasoning about Optimal Stable Matchings under Partial Information. B. Rastegari, A. Condon, N. Immorlica, R. Irving, K. Leyton-Brown. ACM Conference on Economics and Computation (ACM-EC), 2014.
  • An Efficient Approach for Assessing Hyperparameter Importance. F. Hutter, H. Hoos, K. Leyton-Brown. International Conference on Machine Learning (ICML), 2014.
  • Improved Features for Runtime Prediction of Domain-Independent Planners. C. Fawcett, M. Vallati, F. Hutter, J. Hoffmann, H. Hoos, K. Leyton-Brown. International Conference on Automated Planning and Scheduling (ICAPS), 2014.
  • Algorithm Configuration in the Cloud: A Feasibility Study. D. Geschwender, F. Hutter, L. Kotthoff, Y. Malitsky, H. Hoos and K. Leyton-Brown. Learning and Intelligent Optimization Conference (LION7), 2014.
  • AClib: a Benchmark Library for Algorithm Configuration. F. Hutter, M. Lopez-Ibanez, C. Fawcett, M. Lindauer, H. Hoos, K. Leyton-Brown, T. Stützle. Learning and Intelligent Optimization Conference (LION7), 2014.
  • Surrogate Benchmarks for Hyperparameter Optimization.K. Eggensperger, F. Hutter, H. Hoos, K. Leyton-Brown. Workshop on Meta-Learning and Algorithm Selection (MetaSel), co-located with ECAI, 2014.
  • Computational Analysis of Perfect-Information Position Auctions. D. Thompson, K. Leyton-Brown. Working paper, 2014.
  • Evaluating, Understanding, and Improving Behavioral Game Theory Models For Predicting Human Behavior in Unrepeated Normal-Form Games. J. Wright, K. Leyton-Brown. Working paper, 2014.
  • Pragmatic Algorithmic Game Theory. K. Leyton-Brown. Keynote address at ACM Conference on Economics and Computation (ACM-EC), June 12, 2014.
  • Feasibility Checking for Spectrum Repacking: Methodologies and Test Results. K. Leyton-Brown. Talk at FCC LEARN Workshop on Feasibility Checking During Repacking Process, February 21, 2014.

2013

  • Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games. A. Jiang, K. Leyton-Brown. Games and Economics Behavior (GEB), (23 pages), 2013. A journal version of our 2011 ACM-EC conference paper.
    • Preprint: PDF
    • Official version: DOI
  • A Mobile Market for Agricultural Trade in Uganda. R. Ssekibuule, J. Quinn, K. Leyton-Brown. ACM Symposium on Computing for Development (ACM-DEV), 2013.
  • Auto-WEKA: Combined Selection and Hyperparameter Optimization of Classification Algorithms. C. Thornton, F. Hutter, H. Hoos, K. Leyton-Brown. ACM Conference on Knowledge Discovery and Data Mining (KDD), (9 pages), 2013.
  • Two-Sided Matching with Partial Information. B. Rastegari, A. Condon, N. Immorlica, K. Leyton-Brown. ACM Conference on Electronic Commerce (ACM-EC), pp. 733–750, 2013.
  • Revenue Optimization in the Generalized Second-Price Auction. D. Thompson, K. Leyton-Brown. ACM Conference on Electronic Commerce (ACM-EC), pp. 837–852, 2013.
  • Empirical Analysis of Plurality Election Equilibria. D. Thompson, O. Lev, K. Leyton-Brown, J. Rosenschein. International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 391–398, 2013. A preliminary version appeared at the International Workshop on Computational Social Choice (COMSOC), 2012.
  • Identifying Key Algorithm Parameters and Instance Features using Forward Selection. F. Hutter, H. Hoos, K. Leyton-Brown. Learning and Intelligent Optimization Conference (LION7), (15 pages), 2013.
  • Towards an Empirical Foundation for Assessing Bayesian Optimization of Hyperparameters. K. Eggensperger, M. Feurer, F. Hutter, J. Bergstra, J. Snoek, H. Hoos, K. Leyton-Brown. Workshop on Bayesian Optimization, co-located with NIPS, 2013.
  • An Evaluation of Sequential Model-Based Optimization for Expensive Blackbox Functions. F. Hutter, H. Hoos, K. Leyton-Brown. Black-Box-Optimization-Benchmarking (BBOB) workshop at the ACM Genetic and Evolutionary Computation Conference (ACM-GECCO), pp. 1209–1216, 2013.
  • Bayesian Optimization with Censored Response Data. F. Hutter, H. Hoos, K. Leyton-Brown. Working paper, 2013. An extended version of our NIPS workshop paper from 2011.
  • Mechanism Design and Auctions. K. Leyton-Brown, Y. Shoham. Chapter 7 in Multiagent Systems, Second Edition, G. Weiss (editor), pp. 285–327, MIT Press, 2013.
  • Games, Markets & Algorithms: Reasoning about an Interconnected World. A nontechnical overview of my recent work in game theory and mechanism design, UBC CS Faculty Lecture Series, March 21, 2013.
  • The Viability of Exact Feasibility Checking. Talk at the Stanford Institute for Economic Policy Research Conference on the design of the U.S. Incentive Auction for reallocating spectrum between wireless telecommunications and television broadcasting, February 25, 2013.

2012

  • Approximately Revenue-Maximizing Auctions for Deliberative Agents. D. Thompson, K. Leyton-Brown, L.E. Celis, A.R. Karlin, C.T. Nguyen. Conference of the Association for the Advancement of Artificial Intelligence (AAAI), (7 pages), 2012.
  • Predicting Satisfiability at the Phase Transition. L. Xu, H. Hoos, K. Leyton-Brown. Conference of the Association for the Advancement of Artificial Intelligence (AAAI), (7 pages), 2012.
  • The Deployment-to-Saturation Ratio in Security Games. M. Jain, K. Leyton-Brown, M. Tambe. Conference of the Association for the Advancement of Artificial Intelligence (AAAI), (7 pages), 2012.
  • Behavioral Game-Theoretic Models: A Bayesian Framework For Parameter Analysis. J. Wright, K. Leyton-Brown. Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 921930, 2012.
  • Evaluating Component Solver Contributions in Portfolio-based Algorithm Selectors. L. Xu, F. Hutter, K. Leyton-Brown, H. Hoos. Conference on Theory and Applications of Satisfiability Testing (SAT), pp. 228–241, 2012.
  • Parallel Algorithm Configuration. F. Hutter, H.H. Hoos, K. Leyton-Brown. Learning and Intelligent Optimization Conference (LION6), pp. 55–70, 2012. 
  • TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems. Z. Yin, A.X. Jiang, M.P. Johnson, M. Tambe, K. Leyton-Brown, T. Sandholm, J.P. Sullivan, C. Kiekintveld. Conference on Innovative Applications of Artificial Intelligence (IAAI), (8 pages), 2012. A preliminary version appeared as Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems, at the 2012 AAAI Spring Symposium on Game Theory for Security, Sustainability and Health.
  • SATzilla2012: Improved Algorithm Selection Based on Cost-sensitive Classification Models. L. Xu, F. Hutter, J. Shen, H. Hoos, K. Leyton-Brown. International Conference on Theory and Applications of Satisfiability Testing (SAT), SAT Challenge 2012: Solver Descriptions, 2012.
  • Algorithm Configuration for Portfolio-based Parallel SAT-Solving. H. Hoos, K. Leyton-Brown, T. Schaub, M. Schneider. Workshop on Combining Constraint Solving with Mining and Learning (CoCoMile) at the European Conference on Artificial Intelligence (ECAI), (5 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.
    • Preprint: PDF
    • Official journal paper: DOI
  • 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.
    • Preprint: PDF
    • Official journal paper: DOI
    • Software download:  AGG project page
    • Slides from Santa Fe Institue Workshop on Decentralized Control in Systems of Strategic Actors: PDF
  • 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), pp. 218–229, 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), pp. 338–350, 2011.
  • Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games. A.X. Jiang, K. Leyton-Brown. ACM Electronic Commerce Conference (ACM-EC), pp. 119–126, 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.
    • Paper: PDF
    • Presentation from Workshop on Innovations in Algorithmic Game Theory, Hebrew University, Jerusalem: PDF; YouTube video
  • 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), pp. 507–523, 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), pp. 600–615, 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 Response Data. F. Hutter, H. Hoos, K. Leyton-Brown. Workshop on Bayesian Optimization, Experimental Design, and Bandits, at the Neural Information Processing Systems Conference (NIPS), (5 pages), December 2011.
  • 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.
  • Detailed SATzilla Results from the Data Analysis Track of the 2011 SAT Competition. L. Xu, F. Hutter, H. Hoos, K. Leyton-Brown. In Fourteenth International Conference on Theory and Applications of Satisfiability Testing, SAT 2011 Competition: Data Analysis Track, 2011.
  • 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.
    • Paper: PDF
    • Slides from AAAI, Atlanta (by James Wright): PDF
  • 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), pp. 281–298, 2010. Received the runner-up best paper award.
    • Paper: PDF
    • Official Version: DOI
    • Slides from LION, Venice (by Frank Hutter): PDF
  • 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), pp. 186–202, 2010.
    • Paper: PDF
    • Official Version: DOI
    • Slides from CPAIOR, Bologna (by Frank Hutter): PDF
  • 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

 

 

 

 

  • 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.
  • Collusion in Unrepeated, First-Price Auctions with an Uncertain Number of Participants. K. Leyton-Brown, M. Tennenholtz, N.A.R. Bhat, Y. Shoham. 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; 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; 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.
    • Paper: PDF; BIB
    • Slides from TADA, Vancouver (by Erik Zawadzki): PDF
  • 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 RatioE. 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.
    • Thesis: PDF; BIB
    • Slides from my thesis defense, Stanford: PDF
  • 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.
  • Satzilla 0.9. E. Nudelman, K. Leyton-Brown, G. Andrew, C. Gomes, J. McFadden, B. Selman, Y. Shoham. International Conference on Satisfiability Testing, SAT 2003 Competition: Solver Descriptions, Portofino, Italy, 2003.

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. 
    • Preprint: PDF; BIB
    • Official journal paper: DOI
    • Slides from ITCom 2001, Seattle: PDF 
  • 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; 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

  • Towards a Universal Test Suite for Combinatorial Auctions: K. Leyton-Brown, M. Pearson, Y. Shoham.  ACM Conference on Electronic Commerce (EC'00), Minneapolis, 2000. 
  • Bidding Clubs: Institutionalized Collusion in Auctions: K. Leyton-Brown, M. Tennenholtz, Y. Shoham.  ACM Conference on Electronic Commerce (EC'00), Mineapolis, 2000.  A preliminary version was presented at Games 2000, Bilbao. 
  • An Algorithm for Multi-Unit Combinatorial Auctions: K. Leyton-Brown, M. Tennenholtz, Y. Shoham.  American Association for Artificial Intelligence (AAAI-2000), Austin, 2000. It was also presented at the World Congress on Game Theory (Games-2000), Bilbao, 2000, and the International Symposium on Mathematical Programming (ISMP-2000), Atlanta, 2000.

1999