scientific article; zbMATH DE number 4049433

MaRDI QIDQ3786311zbMATH OpenFDO

Authors I. N. Fokin, L. M. Bregman

Publication date 1987

zbMATH Keywords

polymatrix game

Mathematics Subject Classification ID

Linear programming (90C05) Noncooperative games (91A10)

Recommendations

• scientific article; zbMATH DE number 21095
• Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
• On separable non-cooperative zero-sum games
• Two-person nonzero-sum games and quadratic programming
• A noncooperative game on polyhedral sets

Cited in

(8)

• A method for constructing the local points of the Nash equilibrium in a linear game problem
• Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
• Non-Archimedean zero-sum games
• Fictitious play in networks
• Zero-sum polymatrix games: a generalization of minmax
• scientific article; zbMATH DE number 21095 (Why is no real title available?)
• scientific article; zbMATH DE number 7413569 (Why is no real title available?)
• Semidefinite network games: multiplayer minimax and complementarity problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786311)