Computing Equilibria of N-Person Games

DOI10.1137/0121011zbMath0205.23204OpenAlexW2094689434WikidataQ96323709 ScholiaQ96323709MaRDI QIDQ5605046

Robert Wilson

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0121011

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06)

Related Items (9)

Affective empathy in non-cooperative games ⋮ On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach ⋮ Strategic decompositions of normal form games: zero-sum games and potential games ⋮ Regular potential games ⋮ Nash equilibria: complexity, symmetries, and approximation ⋮ 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 ⋮ Copositive-plus Lemke algorithm solves polymatrix games ⋮ A re-evaluation of perfect competition as the solution to the Bertrand price game ⋮ Network formation and pairwise stability: a new oddness theorem

This page was built for publication: Computing Equilibria of N-Person Games