Kevin Leyton-Brown

Orcid: 0000-0002-7644-5327

Affiliations:
  • University of British Columbia, Canada


According to our database1, Kevin Leyton-Brown authored at least 175 papers between 1999 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2020, "For contributions to artificial intelligence, including computational game theory, multi-agent systems, machine learning, and optimization ".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Incentive Auction Design Alternatives: A Simulation Study.
Manag. Sci., 2024

Understanding Understanding: A Pragmatic Framework Motivated by Large Language Models.
CoRR, 2024

Utilitarian Algorithm Configuration for Infinite Parameter Spaces.
CoRR, 2024

What Can Natural Language Processing Do for Peer Review?
CoRR, 2024

Rationality Report Cards: Assessing the Economic Rationality of Large Language Models.
CoRR, 2024

Matching papers and reviewers at large conferences.
Artif. Intell., 2024

Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Mechanical TA 2: Peer Grading with TA and Algorithmic Support.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Agora: Motivating and Measuring Engagement in Large-Class Discussions.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1, 2024

STEER: Assessing the Economic Rationality of Large Language Models.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Generating Benchmarks for Factuality Evaluation of Language Models.
Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics, 2024

UNSAT Solver Synthesis via Monte Carlo Forest Search.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

How to Evaluate Behavioral Models.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Pay to (Not) Play: Monetizing Impatience in Mobile Games.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
In-Context Retrieval-Augmented Language Models.
Trans. Assoc. Comput. Linguistics, 2023

Loss Functions for Behavioral Game Theory.
CoRR, 2023

Utilitarian Algorithm Configuration.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Formalizing Preferences Over Runtime Distributions.
Proceedings of the International Conference on Machine Learning, 2023

Parallel Context Windows for Large Language Models.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2023

Better Peer Grading through Bayesian Inference.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Parallel Context Windows Improve In-Context Learning of Large Language Models.
CoRR, 2022

Monte Carlo Forest Search: UNSAT Solver Synthesis via Reinforcement learning.
CoRR, 2022

Artificial Intelligence and Life in 2030: The One Hundred Year Study on Artificial Intelligence.
CoRR, 2022

MRKL Systems: A modular, neuro-symbolic architecture that combines large language models, external knowledge sources and discrete reasoning.
CoRR, 2022

Standing on the Shoulders of Giant Frozen Language Models.
CoRR, 2022

The New Faculty Highlights Program at AAAI-21.
AI Mag., 2022

The Spotlight: A General Method for Discovering Systematic Errors in Deep Learning Models.
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

The Perils of Learning Before Optimizing.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Automated Configuration and Selection of SAT Solvers.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Mechanical TA 2: A System for Peer Grading with TA Support.
CoRR, 2021

Valid Causal Inference with (Some) Invalid Instruments.
Proceedings of the 38th International Conference on Machine Learning, 2021

PMI-Masking: Principled masking of correlated spans.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Learning under Invariable Bayesian Safety.
CoRR, 2020

Smarter Parking: Using AI to Identify Parking Inefficiencies in Vancouver.
CoRR, 2020

Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

A Formal Separation Between Strategic and Nonstrategic Behavior.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Exemplar Guided Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Incentivizing Evaluation with Peer Prediction and Limited Access to Ground Truth (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Fiduciary Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

Predicting Propositional Satisfiability via End-to-End Learning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Level-0 Models for Predicting Human Behavior in Games.
J. Artif. Intell. Res., 2019

Operations Research Enables Auction to Repurpose Television Spectrum for Next-Generation Wireless Technologies.
INFORMS J. Appl. Anal., 2019

Incentivizing evaluation with peer prediction and limited access to ground truth.
Artif. Intell., 2019

Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Allocation for Social Good: Auditing Mechanisms for Utility Maximization.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Report-Sensitive Spot-checking in Peer Grading Systems.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Auto-WEKA: Automatic Model Selection and Hyperparameter Optimization in WEKA.
Proceedings of the Automated Machine Learning - Methods, Systems, Challenges, 2019

2018
Efficient benchmarking of algorithm configurators via model-based surrogates.
Mach. Learn., 2018

Formalizing the Boundary Between Strategic and Nonstrategic Reasoning.
CoRR, 2018

Deep optimization for spectrum repacking.
Commun. ACM, 2018

Artificial intelligence in 2027.
AI Matters, 2018

Quantifying Algorithmic Improvements over Time.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Deep Models of Interactions Across Sets.
Proceedings of the 35th International Conference on Machine Learning, 2018

Designing and Evolving an Electronic Agricultural Marketplace in Uganda.
Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, 2018

Selection and Configuration of Parallel Portfolios.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
Economics and computer science of a radio spectrum reallocation.
Proc. Natl. Acad. Sci. USA, 2017

Auto-WEKA 2.0: Automatic model selection and hyperparameter optimization in WEKA.
J. Mach. Learn. Res., 2017

Predicting human behavior in unrepeated, simultaneous-move games.
Games Econ. Behav., 2017

Computational analysis of perfect-information position auctions.
Games Econ. Behav., 2017

Assessing Economic Outcomes in Simulated Reverse Clock Auctions for Radio Spectrum.
CoRR, 2017

Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates.
CoRR, 2017

Automatic construction of parallel portfolios via algorithm configuration.
Artif. Intell., 2017

The Configurable SAT Solver Challenge (CSSC).
Artif. Intell., 2017

OASC-2017: *Zilla Submission.
Proceedings of the Open Algorithm Selection Challenge 2017, 2017

Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Deep IV: A Flexible Approach for Counterfactual Prediction.
Proceedings of the 34th International Conference on Machine Learning, 2017

The Positronic Economist: A Computational System for Analyzing Economic Mechanisms.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Resource Graph Games: A Compact Representation for Games with Structured Strategy Spaces.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Models of Level-0 Behavior for Predicting Human Behavior in Games.
CoRR, 2016

Counterfactual Prediction with Deep Instrumental Variables Networks.
CoRR, 2016

Incentivizing Evaluation via Limited Access to Ground Truth: Peer-Prediction Makes Things Worse.
CoRR, 2016

SATenstein: Automatically building local search SAT solvers from components.
Artif. Intell., 2016

ASlib: A benchmark library for algorithm selection.
Artif. Intell., 2016

Multilinear Games.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Deep Learning for Predicting Human Strategic Behavior.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Quantifying the Similarity of Algorithm Configurations.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Bias in Algorithm Portfolio Performance Evaluation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Solving the Station Repacking Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using the Shapley Value to Analyze Algorithm Portfolios.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Introduction to the Special Issue on EC'12.
ACM Trans. Economics and Comput., 2015

Polynomial-time computation of exact correlated equilibrium in compact games.
Games Econ. Behav., 2015

Mechanical TA: Partially Automated High-Stakes Peer Grading.
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

Algorithm Runtime Prediction: Methods and Evaluation (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Efficient Benchmarking of Hyperparameter Optimizers via Surrogates.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Introduction.
Games Econ. Behav., 2014

Empirically Evaluating Multiagent Learning Algorithms.
CoRR, 2014

Understanding the empirical hardness of <i>NP</i>-complete problems.
Commun. ACM, 2014

Algorithm runtime prediction: Methods & evaluation.
Artif. Intell., 2014

Level-0 meta-models for predicting human behavior in games.
Proceedings of the ACM Conference on Economics and Computation, 2014

Reasoning about optimal stable matchings under partial information.
Proceedings of the ACM Conference on Economics and Computation, 2014

Pragmatic algorithmic game theory.
Proceedings of the ACM Conference on Economics and Computation, 2014

AClib: A Benchmark Library for Algorithm Configuration.
Proceedings of the Learning and Intelligent Optimization, 2014

Algorithm Configuration in the Cloud: A Feasibility Study.
Proceedings of the Learning and Intelligent Optimization, 2014

An Efficient Approach for Assessing Hyperparameter Importance.
Proceedings of the 31th International Conference on Machine Learning, 2014

Surrogate Benchmarks for Hyperparameter Optimization.
Proceedings of the International Workshop on Meta-learning and Algorithm Selection co-located with 21st European Conference on Artificial Intelligence, 2014

Improved Features for Runtime Prediction of Domain-Independent Planners.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Evaluating, Understanding, and Improving Behavioral Game Theory Models For Predicting Human Behavior in Unrepeated Normal-Form Games.
CoRR, 2013

Bayesian Optimization With Censored Response Data.
CoRR, 2013

Revenue optimization in the generalized second-price auction.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Two-sided matching with partial information.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Identifying Key Algorithm Parameters and Instance Features Using Forward Selection.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

An evaluation of sequential model-based optimization for expensive blackbox functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A mobile market for agricultural trade in Uganda.
Proceedings of the Annual Symposium on Computing for Development, 2013

Empirical analysis of plurality election equilibria.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Algorithm Runtime Prediction: The State of the Art
CoRR, 2012

Auto-WEKA: Automated Selection and Hyper-Parameter Optimization of Classification Algorithms
CoRR, 2012

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory.
AI Mag., 2012

Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Parallel Algorithm Configuration.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems.
Proceedings of the Twenty-Fourth Conference on Innovative Applications of Artificial Intelligence, 2012

Behavioral game theoretic models: a Bayesian framework for parameter analysis.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems.
Proceedings of the Game Theory for Security, 2012

A Study of Phase Transitions in Security Games.
Proceedings of the Game Theory for Security, 2012

Predicting Satisfiability at the Phase Transition.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Deployment-to-Saturation Ratio in Security Games.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Approximately Revenue-Maximizing Auctions for Deliberative Agents.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Linear solvers for nonlinear games: using pivoting algorithms to find Nash equilibria in <i>n</i>-player games.
SIGecom Exch., 2011

Polynomial computation of exact correlated equilibrium in compact games.
SIGecom Exch., 2011

Action-Graph Games.
Games Econ. Behav., 2011

A General Framework for Computing Optimal Correlated Equilibria in Compact Games
CoRR, 2011

Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions.
Artif. Intell., 2011

Computing Nash Equilibria of Action-Graph Games via Support Enumeration.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

A General Framework for Computing Optimal Correlated Equilibria in Compact Games - (Extended Abstract).
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

Sequential Model-Based Optimization for General Algorithm Configuration.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

Dominant-Strategy Auction Design for Agents with Uncertain, Private Values.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Modeling and Monitoring Crop Disease in Developing Countries.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Tradeoffs in the empirical evaluation of competing algorithm designs.
Ann. Math. Artif. Intell., 2010

Algorithmic Game Theory and Artificial Intelligence.
AI Mag., 2010

Computing pure strategy nash equilibria in compact symmetric games.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Bayesian Action-Graph Games.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Time-Bounded Sequential Parameter Optimization.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

Automated Configuration of Mixed Integer Programming Solvers.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Symmetric games with piecewise linear utilities.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Beyond Equilibrium: Predicting Human Behavior in Normal-Form Games.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Comparing Position Auctions Computationally.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches.
Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

2009
ParamILS: An Automatic Algorithm Configuration Framework.
J. Artif. Intell. Res., 2009

Empirical hardness models: Methodology and a case study on combinatorial auctions.
J. ACM, 2009

Temporal Action-Graph Games: A New Representation for Dynamic Games.
Proceedings of the UAI 2009, 2009

Stepwise randomized combinatorial auctions achieve revenue monotonicity.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

An experimental investigation of model-based parameter optimisation: SPO and beyond.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations.
Cambridge University Press, ISBN: 978-0-521-89943-7, 2009

2008
Essentials of Game Theory: A Concise Multidisciplinary Introduction
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, ISBN: 978-3-031-01545-8, 2008

Book announcements: multiagent systems and essentials of game theory.
SIGecom Exch., 2008

SATzilla: Portfolio-based Algorithm Selection for SAT.
J. Artif. Intell. Res., 2008

2007
Revenue monotonicity in combinatorial auctions.
SIGecom Exch., 2007

Bidding agents for online auctions with hidden bids.
Mach. Learn., 2007

Hierarchical Hardness Models for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2007

: The Design and Analysis of an Algorithm Portfolio for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Valuation Uncertainty and Imperfect Introspection in Second-Price Auctions.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Computing Pure Nash Equilibria in Symmetric Action Graph Games.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2006

A Polynomial-Time Algorithm for Action Graph Games.
Proceedings of the Proceedings, 2006

2004
Computing Nash Equilibria of Action-Graph Games.
Proceedings of the UAI '04, 2004

Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003
Resource allocation in competitive multiagent systems.
PhD thesis, 2003

Conference report: the fourth ACM conference on electronic commerce.
SIGecom Exch., 2003

Incentive mechanisms for smoothing out a focused demand for network resources.
Comput. Commun., 2003

Local-Effect Games.
Proceedings of the IJCAI-03, 2003

A Portfolio Approach to Algorithm Selection.
Proceedings of the IJCAI-03, 2003

Boosting as a Metaphor for Algorithm Design.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Bidding Clubs in First-Price Auctions.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Incentives for Sharing in Peer-to-Peer Networks.
Proceedings of the Electronic Commerce, Second International Workshop, 2001

Smoothing out focused demand for network resources.
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

Incentives for sharing in peer-to-peer networks.
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

2000
Bidding clubs: institutionalized collusion in auctions.
Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), 2000

Towards a universal test suite for combinatorial auction algorithms.
Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), 2000

An Algorithm for Multi-Unit Combinatorial Auctions.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999


  Loading...