Sciweavers

5995 search results - page 107 / 1199
» Algorithmic Game Theory
Sort
View
137
Voted
KER
2008
193views more  KER 2008»
15 years 3 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
98
Voted
GAMEON
2007
15 years 5 months ago
Teaching AI Concepts by Using Casual Games: A Case Study
Nowadays it is not uncommon for computer games to be used as tools to help introduce basic computer science concepts. In this paper we argue that games could also be used in more ...
Cesar Tadeu Pozzer, Börje Karlsson
132
Voted
CORR
2011
Springer
212views Education» more  CORR 2011»
14 years 10 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
137
Voted
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
16 years 3 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
143
Voted
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 5 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn