Sciweavers

5995 search results - page 74 / 1199
» Algorithmic Game Theory
Sort
View
DIGRA
2005
Springer
15 years 7 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
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 8 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
FORMATS
2010
Springer
14 years 11 months ago
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
Patricia Bouyer, Romain Brenguier, Nicolas Markey
FORMATS
2007
Springer
15 years 5 months ago
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
Franck Cassez
EOR
2007
109views more  EOR 2007»
15 years 1 months ago
Accessibility in oriented networks
The aim of this work is to present a numerical measure of the importance of each player in a cooperative game when the cooperation possibilities are limited according to the links...
Rafael Amer, José Miguel Giménez, An...