5995 search results - page 34 / 1199 » Algorithmic Game Theory |
SAGT
2009
Springer
15 years 6 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 ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. ...
109
click to vote
STOC
2009
ACM
16 years 3 days ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
132
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
119
click to vote
ATAL
2011
Springer
13 years 11 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...