Sciweavers

449 search results - page 45 / 90
» Cooperative Boolean games
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
ATAL
2005
Springer
14 years 1 months ago
A cooperative multi-agent approach to free flight
The next generation of air traffic control will require automated decision support systems in order to meet safety, reliability, flexibility, and robustness demands in an environ...
Jared C. Hill, F. Ryan Johnson, James K. Archibald...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
JSAC
2008
121views more  JSAC 2008»
13 years 7 months ago
Network Coding Games with Unicast Flows
Abstract--To implement network coding, users need to coordinate and cooperate with respect to their strategies in terms of duplicating and transmitting side information across spec...
Jennifer Price, Tara Javidi
INFOCOM
2008
IEEE
14 years 2 months ago
Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks
—Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a non-cooperative wireless network, where devices are selï¬...
Fan Wu, Sheng Zhong, Chunming Qiao