2446 search results - page 475 / 490 » Choiceless Polynomial Time |
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
WALCOM
2007
IEEE
13 years 8 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...