swMATH30178MaRDI QIDQ41892FDOQ41892
Author name not available (Why is that?)
Official website: http://gamut.stanford.edu/
Cited In (27)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- When autonomous agents model other agents: an appeal for altered judgment coupled with mouths, ears, and a little more tape
- Action-graph games
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- Title not available (Why is that?)
- Automatic verification of concurrent stochastic systems
- A metaheuristic approach to compute pure Nash equilibria
- dot
- GAVS
- Gambit
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
- GIST
- PRALINE
- PRISM-games
- EVE
- MCMAS-SLK
- GDL
- Simple search methods for finding a Nash equilibrium
- Nashpy
- AWESOME
- Behavioural strategies in weighted Boolean games
- Solving possibilistic games with incomplete information
- A general criterion and an algorithmic framework for learning in multi-agent systems
- Computing equilibria: a computational complexity perspective
- If multi-agent learning is the answer, what is the question?
- Learning equilibria of games via payoff queries
- A global optimization algorithm for solving a four-person game
This page was built for software: GAMUT
