On the Complezity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called AngelDaemon games. Those games were introduced to asses the goodness of a web or grid orchestration on a faulty environment with bounded amount of failures
Joaquim Gabarro Alina Garcia Maria Serna
ALBCOM Research Group Universitat Politecnica de Catalunya Edifici Ω, Campus Nord,Jordi Girona, 1-3, Barcelona 08034, Spain
国际会议
The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)
大连
英文
31-40
2008-06-01(万方平台首次上网日期,不代表论文的发表时间)