Sciweavers

355 search results - page 28 / 71
» On Ramsey-type positional games
Sort
View
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
NIPS
2007
13 years 10 months ago
Competition Adds Complexity
It is known that determinining whether a DEC-POMDP, namely, a cooperative partially observable stochastic game (POSG), has a cooperative strategy with positive expected reward is ...
Judy Goldsmith, Martin Mundhenk
WWW
2009
ACM
14 years 9 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 1 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
FDG
2009
ACM
14 years 3 months ago
Robust resource allocation in a massive multiplayer online gaming environment
The environment considered in this research is a massive multiplayer online gaming (MMOG) environment. Each user controls an avatar (an image that represents and is manipulated by...
Luis Diego Briceno, Howard Jay Siegel, Anthony A. ...