scientific article; zbMATH DE number 1099369
From MaRDI portal
Publication:4369429
zbMath1126.91304MaRDI QIDQ4369429
Andrew McLennan, Richard D. McKelvey
Publication date: 28 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (45)
A solution to matching with preferences over colleagues ⋮ Computing approximate Nash equilibria in general network revenue management games ⋮ Computing a quasi-perfect equilibrium of a two-player game ⋮ Homotopy methods to compute equilibria in game theory ⋮ Computing equilibria: a computational complexity perspective ⋮ An algorithm for finding approximate Nash equilibria in bimatrix games ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ Computing pure Nash equilibria in network revenue management games ⋮ An alternating direction method for Nash equilibrium of two-person games with alternating offers ⋮ Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games ⋮ An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games ⋮ An approach for reducing the graphical model and genetic algorithm for computing approximate Nash equilibrium in static games ⋮ Representations and solutions for game-theoretic problems ⋮ The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game ⋮ Multi-agent influence diagrams for representing and solving games. ⋮ Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition ⋮ Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments ⋮ Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification ⋮ 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 ⋮ Polymatrix games and optimization problems ⋮ A differentiable homotopy method to compute perfect equilibria ⋮ A dynamic Cournot-Nash game: a representation of a finitely repeated feedback game ⋮ Simple search methods for finding a Nash equilibrium ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ Good neighbors are hard to find: Computational complexity of network formation ⋮ Computing Nash equilibria by iterated polymatrix approximation ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ An experimental study of a DC optimization algorithm for bimatrix games ⋮ Approximate Nash equilibria in anonymous games ⋮ Computing Nash equilibria through computational intelligence methods ⋮ A Generative Relation for Nash Equilibria on Symmetric Action Graph Games ⋮ Robust game theory ⋮ A parametric representation of totally mixed Nash equilibria ⋮ Finding all equilibria in games of strategic complements ⋮ More strategies, more Nash equilibria ⋮ Separable and low-rank continuous games ⋮ Computing Nash equilibria for scheduling on restricted parallel links ⋮ A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria ⋮ Commitment games ⋮ The algebraic geometry of perfect and sequential equilibrium: an extension ⋮ AN APPROACH FOR SOLVING FUZZY GAMES ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Polynomial-time computation of exact correlated equilibrium in compact games ⋮ Entropic penalties in finite games ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
Uses Software
This page was built for publication:
