5995 search results - page 319 / 1199 » Algorithmic Game Theory |
195
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
154
click to vote
FLAIRS
2003
15 years 8 months ago
2003
In this paper, we discuss a formalism for modeling regions that are exposed to movement or deformation. The basis of our formalism is the RCC theory, which uses topological relati...
181
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
166
click to vote
AIIDE
2006
15 years 8 months ago
2006
Modeling the behavior of Non-Player Characters (NPCs) so that they can act properly in an artificial world is a difficult, yet essential task in the development of modern computer...
164
click to vote
NIPS
2003
15 years 8 months ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...