PERVASIVE
2006
Springer
13 years 4 months ago
2006
Springer
In this paper we present an initial user feedback study of the Road Rager prototype. Road Rager is a mixed reality game, designed to enable passengers in different cars to play aga...
ORL
2008
13 years 4 months ago
2008
We study a collaborative multicommodity flow game where individual players own capacity on the edges of the network and share this capacity to deliver commodities. We present memb...
MP
2006
13 years 4 months ago
2006
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
MOR
2006
13 years 4 months ago
2006
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
MLQ
2008
13 years 4 months ago
2008
The stationary set splitting game is a game of perfect information of length 1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinal...
ENDM
2007
13 years 4 months ago
2007
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
EJC
2007
13 years 4 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
EJC
2007
13 years 4 months ago
2007
Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...
KI
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we present an interactive poker game in which one human user plays against two animated agents using RFID-tagged poker cards. The game is used as a showcase to illust...
JGT
2008
13 years 4 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....