Sciweavers

35 search results - page 1 / 7
» A Computational Analysis of the Tournament Equilibrium Set
Sort
View
AAAI
2008
13 years 7 months ago
A Computational Analysis of the Tournament Equilibrium Set
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, ...
CG
2004
Springer
13 years 10 months ago
Strategic Interactions in the TAC 2003 Supply Chain Tournament
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...
IJCAI
2007
13 years 6 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
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, ...
ATAL
2009
Springer
13 years 11 months ago
Modeling billiards games
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 ...
Christopher Archibald, Yoav Shoham
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 5 months ago
How to rank with few errors
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...
Claire Kenyon-Mathieu, Warren Schudy