5995 search results - page 178 / 1199 » Algorithmic Game Theory |
126
click to vote
ENTCS
2006
15 years 3 months ago
2006
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
131
click to vote
DCG
1999
15 years 3 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
147
click to vote
NETGAMES
2006
ACM
15 years 10 months ago
2006
ACM
We present an approach to support Massively Multiplayer Online Role-Playing Games. Our proposed solution begins by splitting the large virtual world into smaller regions, each reg...
141
click to vote
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
In order to succeed, agents playing games must reason about the mechanics of the game, the strategies of other agents, other agents’ reasoning about their strategies, and the ra...
117
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms m...