Pages that link to "Item:Q847809"
From MaRDI portal
The following pages link to Enumeration of Nash equilibria for two-player games (Q847809):
Displaying 35 items.
- Functional dependence in strategic games (Q306824) (← links)
- On taxed matrix games and changes in the expected transfer (Q457868) (← links)
- Equilibrium payoffs of finite games (Q533910) (← links)
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games (Q816528) (← links)
- Homotopy methods to compute equilibria in game theory (Q847802) (← links)
- Finding all Nash equilibria of a finite game using polynomial algebra (Q847806) (← links)
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531) (← links)
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies (Q903026) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form (Q1718839) (← links)
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem (Q1754126) (← links)
- Security games over lexicographic orders (Q2056964) (← links)
- A normal form game model of search and pursuit (Q2087115) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- A note on bimatrix game maximal Selten subsets (Q2254918) (← links)
- Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
- A detail-free mediator (Q2436299) (← links)
- Enumeration of all extreme equilibria of bimatrix games (Q2780527) (← links)
- Effects of Profit Taxes in Matrix Games (Q2806897) (← links)
- Computing all solutions of Nash equilibrium problems with discrete strategy sets (Q2828338) (← links)
- Rational generating functions and integer programming games (Q2893918) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- Algorithms for Closed Under Rational Behavior (CURB) Sets (Q3588639) (← links)
- Nash equilibrium in a stochastic model of two competing athletes (Q4964599) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- On Random Symmetric Bimatrix Games (Q5012901) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games (Q5301416) (← links)
- (Q5448408) (← links)
- Automated equilibrium analysis of \(2\times 2\times 2\) games (Q6109520) (← links)