Sciweavers

14084 search results - page 37 / 2817
» A Theory for Game Theories
Sort
View
DIGRA
2005
Springer
14 years 1 months ago
End of story? Quest, narrative and enactment in computer games
Espen Aarseth recently claimed that all games referred to as ’narrative games’ could better be described as ’quest games’. The writer of this paper suggests that Max Payne...
Anders Sundnes Løvlie
TEI
2010
ACM
160views Hardware» more  TEI 2010»
14 years 2 months ago
Creative idea exploration within the structure of a guiding framework: the card brainstorming game
I present a card brainstorming exercise that transforms a conceptual tangible interaction framework into a tool for creative dialogue and discuss the experiences made in using it....
Eva Hornecker
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
13 years 6 months ago
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
SAC
2004
ACM
14 years 1 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 6 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik