Sciweavers

36 search results - page 5 / 8
» Computational Complexity of Weighted Threshold Games
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Acceleration of adaptive proximal forward-backward splitting method and its application to sparse system identification
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
Masao Yamagishi, Masahiro Yukawa, Isao Yamada
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
13 years 6 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
CEC
2005
IEEE
13 years 9 months ago
Evolving autonomous agent control in the Xpilot environment
Abstract- Interactive combat games are useful as testbeds for learning systems employing evolutionary computation. Of particular value are games that can be modified to accommodate...
Gary B. Parker, Matt Parker, Steven D. Johnson
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ATAL
2008
Springer
13 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...