144 search results - page 23 / 29 » Computing Nash Equilibria of Action-Graph Games |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
ECAI
2006
Springer
14 years 3 days ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
AAAI
2012
11 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...