UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Strategic information diffusion through online social networks
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
The complexity of games on highly regular graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On minmax theorems for multiplayer games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of approximating a Nash equilibrium
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Tα Παιδíα Παíζϵι the interaction between algorithms and game theory
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Computing equilibria using interval constraints
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
A general framework for computing optimal correlated equilibria in compact games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Computing nash equilibria of action-graph games via support enumeration
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
Distributed iterated elimination of strictly dominated strategies
Autonomous Agents and Multi-Agent Systems
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
Automatica (Journal of IFAC)
Learning and predicting dynamic networked behavior with graphical multiagent models
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Exploiting model equivalences for solving interactive dynamic influence diagrams
Journal of Artificial Intelligence Research
Finding pure nash equilibrium of graphical game via constraints satisfaction approach
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Finding a nash equilibrium by asynchronous backtracking
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Choosing products in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Graph formation effects on social welfare and inequality in a networked resource game
SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Empirical analysis of plurality election equilibria
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Social context congestion games
Theoretical Computer Science
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
On the Windfall and price of friendship: Inoculation strategies on social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in one-stage games represented by trees or sparse graphs.