Sciweavers

5995 search results - page 42 / 1199
» Algorithmic Game Theory
Sort
View
MOBIHOC
2008
ACM
15 years 11 months ago
A game approach for multi-channel allocation in multi-hop wireless networks
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
Lin Gao, Xinbing Wang
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
15 years 3 months ago
The parallel Nash Memory for asymmetric games
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlas...
ICML
2004
IEEE
16 years 12 days ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
ATAL
2009
Springer
15 years 6 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
WINE
2010
Springer
162views Economy» more  WINE 2010»
14 years 9 months ago
Near-Strong Equilibria in Network Creation Games
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
Ola Rozenfeld, Moshe Tennenholtz