1410 search results - page 38 / 282 » The Algorithmics of Solitaire-Like Games |
65
Voted
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
83
Voted
JGAA
2007
14 years 9 months ago
2007
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
101
Voted
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
FLAIRS
2007
14 years 12 months ago
2007
General Game Playing is the problem of designing an agent capable of playing any previously unknown game when given only the rules. This paper describes the implementation archite...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...