1410 search results - page 58 / 282 » The Algorithmics of Solitaire-Like Games |
AAIM
2006
Springer
15 years 3 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
112
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
103
click to vote
SIGECOM
2005
ACM
15 years 4 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
ICDM
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accura...
100
click to vote
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...