Computing Equilibria of N-Person Games
From MaRDI portal
Publication:5623549
DOI10.1137/0121011zbMath0218.90077OpenAlexW2094689434WikidataQ96323709 ScholiaQ96323709MaRDI QIDQ5623549
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
Related Items (34)
The theory of normal form games from the differentiable viewpoint ⋮ A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes ⋮ Structural stability implies robustness to bounded rationality ⋮ Homotopy methods to compute equilibria in game theory ⋮ A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems ⋮ Generic finiteness of equilibrium distributions for bimatrix outcome game forms ⋮ Computational economics and economic theory: Substitutes or complements? ⋮ Markov perfect equilibria in repeated asynchronous choice games ⋮ A global Newton method to compute Nash equilibria. ⋮ Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise ⋮ Consensus Game: An Extension of Battle of the Sexes Game ⋮ Uniqueness of stationary equilibrium payoffs in coalitional bargaining ⋮ On perfect Nash equilibria of polymatrix games ⋮ Nonlinear programming and stationary equilibria in stochastic games ⋮ Implementing the modified LH algorithm ⋮ Semidefinite programming for min-max problems and games ⋮ Power Law Public Goods Game for Personal Information Sharing in News Commentaries ⋮ Multilateral negotiations and formation of coalitions ⋮ Computing Nash equilibria by iterated polymatrix approximation ⋮ A path-following procedure to find a proper equilibrium of finite games ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ Oddness of the number of equilibrium points: a new proof ⋮ The distribution of optimal strategies in symmetric zero-sum games ⋮ Deriving Nash equilibria as the supercore for a relational system ⋮ Markov perfect equilibrium. I: Observable actions ⋮ Determinacy of equilibrium in outcome game forms ⋮ Finding mixed strategies with small supports in extensive form games ⋮ About extreme equilibrium points ⋮ Decision making and games with vector outcomes ⋮ Some Topics on Equilibria ⋮ A mathematical programming approach for determining oligopolistic market equilibrium ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
This page was built for publication: Computing Equilibria of N-Person Games
