The following pages link to GAMUT (Q41892):
Displaying 16 items.
- Action-graph games (Q625044) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- If multi-agent learning is the answer, what is the question? (Q1028919) (← links)
- Solving possibilistic games with incomplete information (Q2077019) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Behavioural strategies in weighted Boolean games (Q2225600) (← links)
- When autonomous agents model other agents: an appeal for altered judgment coupled with mouths, ears, and a little more tape (Q2302289) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- A general criterion and an algorithmic framework for learning in multi-agent systems (Q2384145) (← links)
- A global optimization algorithm for solving a four-person game (Q2421448) (← links)
- A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) (← links)
- A Global Optimization Approach to Nonzero Sum Six-Person Game (Q5118431) (← links)
- (Q5234185) (← links)
- (Q5744805) (← links)
