5995 search results - page 88 / 1199 » Algorithmic Game Theory |
157
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
108
Voted
TCS
2010
15 years 1 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
148
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
124
click to vote
UAI
2004
15 years 4 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
114
click to vote
KI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...