Sciweavers

1650 search results - page 276 / 330
» The HOM problem is decidable
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 6 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
TCS
2010
13 years 6 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
TPDS
2010
83views more  TPDS 2010»
13 years 6 months ago
Robust Load Delegation in Service Grid Environments
—In this paper, we address the problem of finding well-performing workload exchange policies for decentralized Computational Grids using an Evolutionary Fuzzy System. To this end...
Alexander Fölling, Christian Grimme, Joachim ...
VTC
2010
IEEE
163views Communications» more  VTC 2010»
13 years 6 months ago
Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Ha...
ANTSW
2010
Springer
13 years 5 months ago
Self-organized Task Partitioning in a Swarm of Robots
Abstract. In this work, we propose a method for self-organized adaptive task partitioning in a swarm of robots. Task partitioning refers to the decomposition of a task into less co...
Marco Frison, Nam-Luc Tran, Nadir Baiboun, Arne Br...