A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
The TAC 2003 supply-chaingame presented automated trading agents with a challenging strategic problem. Embedded within a complex stochastic environment was a pivotal strategic deci...
Joshua Estelle, Yevgeniy Vorobeychik, Michael P. W...
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...