796 search results - page 50 / 160 » The canonical function game |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
AAAI
2008
13 years 10 months ago
2008
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...
AAAI
2010
13 years 8 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
COMBINATORICS
2007
13 years 7 months ago
2007
![The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor")
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...