533 search results - page 50 / 107 » Playing games with approximation algorithms |
AAAI
2007
13 years 10 months ago
2007
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
IPL
2002
13 years 7 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
NIPS
2007
13 years 9 months ago
2007
We study the problem of an apprentice learning to behave in an environment with an unknown reward function by observing the behavior of an expert. We follow on the work of Abbeel ...
ATAL
2009
Springer
14 years 2 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...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...