28 search results - page 2 / 6 » Algorithms for Finding Approximate Formations in Games |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
JACM
2007
13 years 5 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...