122 search results - page 9 / 25 » Probabilistic Techniques in Algorithmic Game Theory |
DAC
2007
ACM
14 years 15 days ago
2007
ACM
The number of features that are supported in modern multimedia devices is increasing faster than ever. Estimating the performance of such applications when they are running on sha...
SAGT
2009
Springer
14 years 3 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
ATAL
2011
Springer
12 years 8 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...