234 search results - page 28 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
SODA
2007
ACM
14 years 11 months ago
2007
ACM
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
UAI
2008
14 years 11 months ago
2008
We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) repres...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—The effectiveness of online feedback mechanisms for rating the performance of providers in electronic markets is vulnerable to the submission of dishonest ratings. In this paper...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...