5995 search results - page 82 / 1199 » Algorithmic Game Theory |
130
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
125
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
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...
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a constrained mechanism design setting called internal implementation, in which the mechanism designer is explicitly modeled as a player in the game of interest. This...
113
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
221
Voted
CCIA
2010
Springer
14 years 10 months ago
2010
Springer
The implementation of AI in commercial games is usually based on low level designs that makes the control predictable, unadaptive, and non reusable. Reorithms such as HTN or GOAP p...