A General Framework for Computing Optimal Correlated Equilibria in Compact Games

A Test Suite for Combinatorial Auctions

A mobile market for agricultural trade in Uganda

scholarly article published 2013

AClib: A Benchmark Library for Algorithm Configuration

ASlib: A benchmark library for algorithm selection

Action-Graph Games

Algorithm Configuration in the Cloud: A Feasibility Study

Algorithm runtime prediction: Methods & evaluation

An evaluation of sequential model-based optimization for expensive blackbox functions

An experimental investigation of model-based parameter optimisation

Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms

scholarly article by Chris Thornton et al published 2013 in Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining

Automated Configuration of Mixed Integer Programming Solvers

Automatic construction of parallel portfolios via algorithm configuration

Bidding agents for online auctions with hidden bids

Bidding clubs

article published in 2000

Book announcements

Boosting as a Metaphor for Algorithm Design

Computational analysis of perfect-information position auctions

Computational analysis of perfect-information position auctions

Computing Nash Equilibria of Action-Graph Games via Support Enumeration

Computing pure strategy nash equilibria in compact symmetric games

Conference report

Deep Learning for Predicting Human Strategic Behavior ⬇️

scientific article published in January 2016

Economics and computer science of a radio spectrum reallocation

scientific article published on 26 June 2017

Empirical Hardness Models for Combinatorial Auctions

Empirical hardness models

Essentials of Game Theory: A Concise Multidisciplinary Introduction

Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors

article published in 2012

HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms

Identifying Key Algorithm Parameters and Instance Features Using Forward Selection

article by Frank Hutter et al published 2013 in Lecture Notes in Computer Science

Incentive mechanisms for smoothing out a focused demand for network resources

Incentives for sharing in peer-to-peer networks

Introduction

Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions

Level-0 meta-models for predicting human behavior in games

Linear solvers for nonlinear games

Mechanical TA

Multiagent Systems

Multilinear Games

Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms

scholarly article by Frank Hutter et al published 2006 in Lecture Notes in Computer Science

Polynomial computation of exact correlated equilibrium in compact games

Polynomial-time computation of exact correlated equilibrium in compact games

Polynomial-time computation of exact correlated equilibrium in compact games

Pragmatic algorithmic game theory

Predicting human behavior in unrepeated, simultaneous-move games

Quantifying the Similarity of Algorithm Configurations

Reasoning about optimal stable matchings under partial information

Revenue monotonicity in combinatorial auctions

Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions

Revenue optimization in the generalized second-price auction

SATenstein: Automatically building local search SAT solvers from components

SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT

Sequential Model-Based Optimization for General Algorithm Configuration

Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches

Smoothing out focused demand for network resources

Stepwise Randomized Combinatorial Auctions Achieve Revenue Monotonicity

Symmetric games with piecewise linear utilities

The Configurable SAT Solver Challenge (CSSC)

Time-Bounded Sequential Parameter Optimization

Towards a universal test suite for combinatorial auction algorithms

scholarly article published 2000

Tradeoffs in the empirical evaluation of competing algorithm designs

Two-sided matching with partial information

scholarly article published 2013

Understanding Random SAT: Beyond the Clauses-to-Variables Ratio

Understanding the empirical hardness ofNP-complete problems