On separable non-cooperative zero-sum games

DOI10.1080/02331939808844400MaRDI QIDQ4224669zbMATH OpenOpenAlexFDO

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

Publication date 25 May 1999

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939808844400

zbMATH Keywords

column generationlinear programmingnon-cooperative zero-sum gamesresource allocation

Mathematics Subject Classification ID

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

Recommendations

• On cooperative games, inseparable by semivalues
• scientific article; zbMATH DE number 3856864
• scientific article; zbMATH DE number 4006016
• scientific article; zbMATH DE number 4055416
• On noncooperative games, minimax theorems, and equilibrium problems
• scientific article; zbMATH DE number 3882234
• Separability by semivalues modified for games with coalition structure
• Non-Archimedean zero-sum games
• On the separation conjecture in avoider-enforcer games
• scientific article; zbMATH DE number 18893

Cited in

(13)

• A noncooperative game on polyhedral sets
• Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
• Non-Archimedean zero-sum games
• Strategic decompositions of normal form games: zero-sum games and potential games
• Fictitious play in networks
• Symmetric zero-sum games with only asymmetric equilibria
• A parallel algorithm for non-cooperative resource allocation games
• Zero-sum polymatrix games: a generalization of minmax
• scientific article; zbMATH DE number 4049433 (Why is no real title available?)
• Separable Network Games with Compact Strategy Sets
• Semidefinite network games: multiplayer minimax and complementarity problems
• A noncooperative n-person semi-Markov game with a separable metric state space
• Separable and low-rank continuous games

This page was built for publication: On separable non-cooperative zero-sum games

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