Christian Kroer

Suggest Changes
Michael H. Bowling41
Tuomas W. Sandholm37
Kevin Leyton-Brown29
Neil Burch28
Marc Lanctot28
22Tuomas W. Sandholm
6Noam Brown
6Rune Møller Jensen
4Paolo Viappiani
3Martin Kjær Svendsen

Filter Results:

  • Full text PDF available (22)

Publication Year

2011
2017

Publication Type

Co-author

Publication Venue

Key Phrases

Learn More
Automated Planning for Liner Shipping Fleet Repositioning
The Liner Shipping Fleet Repositioning Problem (LSFRP) poses a large financial burden on liner shipping firms. During repositioning, vessels are moved between services in a liner shipping network. The LSFRP is characterized by chains of interacting activities, many of which have costs that are a function of their duration; for example, sailing slowly… (More)
Feature Filtering for Instance-Specific Algorithm Configuration
Instance-Specific Algorithm Configuration (ISAC) is a novel general technique for automatically generating and tuning algorithm portfolios. The approach has been very successful in practice, but up to now it has been committed to using all the features it was provided. However, traditional feature filtering techniques are not applicable, requiring multiple… (More)
Extensive-Form Game Imperfect-Recall Abstractions With Bounds
Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees on solution quality are known. In this paper, we show the first general, algorithm-agnostic, solution… (More)
SAT and SMT-based Interactive Configuration for Container Vessel Stowage Planning Master’s Thesis
The container vessel stowage problem is a hard combinatorial optimization problem concerned with the placement of containers on a container vessel, subject to various constraints. It is often the case that stowage coordinators need to modify existing stowage plans, while preserving their optimality. An interactive configuration system can guide the… (More)
Computational Bundling for Auctions
Revenue maximization in combinatorial auctions (and other mul-tidimensional selling settings) is one of the most important and elusive problems in mechanism design. The optimal design is unknown , and is known to include features that are not acceptable in many applications, such as favoring some bidders over others and randomization. In this paper, we… (More)
Power napping with loud neighbors: optimal energy-constrained jamming and anti-jamming
The openness of wireless communication and the recent development of software-defined radio technology, respectively, provide a low barrier and a wide range of capabilities for misbehavior, attacks, and defenses against attacks. In this work we present finite-energy jamming games, a game model that allows a jammer and sender to choose (1) whether to… (More)
Robust Optimization of Recommendation Sets with the Maximin Utility Criterion
We investigate robust decision-making under utility uncertainty, using the maximin criterion, which optimizes utility for the worst case setting. We show how it is possible to efficiently compute the maximin optimal recommendation in face of utility uncertainty, even in large configuration spaces. We then introduce a new decision criterion, setwise maximin… (More)
Faster First-Order Methods for Extensive-Form Game Solving
We study the problem of computing a Nash equilibrium in large-scale two-player zero-sum extensive-form games. While this problem can be solved in polynomial time, first-order or regret-based methods are usually preferred for large games. Regret-based methods have largely been favored in practice, in spite of their theoretically inferior convergence rates.… (More)
Discretization of Continuous Action Spaces in Extensive-Form Games
Extensive-form games are a powerful tool for modeling a large range of multiagent scenarios. However, most solution algorithms require discrete, finite games. In contrast, many real-world domains require modeling with continuous action spaces. This is usually handled by heuristically dis-cretizing the continuous action space without solution quality bounds.… (More)