Sciweavers

894 search results - page 33 / 179
» Game Theory with Costly Computation
Sort
View
WIMOB
2008
IEEE
15 years 8 months ago
A Moderate to Robust Game Theoretical Model for Intrusion Detection in MANETs
—One popular solution for reducing the resource consumption of Intrusion Detection System (IDS) in MANET is to elect a head-cluster (leader) to provide intrusion detection servic...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...
126
Voted
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 2 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
DIGRA
2003
Springer
15 years 7 months ago
As if by Magic: On Harry Potter as a Novel and Computer Game
This paper examines the computer game Harry Potter and the Philosopher’s Stone in relation to the novel with the same title. The analysis focuses on the temporal aspects of the ...
Anna Gunder
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
15 years 8 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 8 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang