Aggregation in linear programming and in matrix games

MaRDI QIDQ2567601zbMATH OpenFDO

Authors V. G. Mednitskiĭ, Yu. V. Mednitskii

Publication date 11 October 2005

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05)

Recommendations

• On the Core and Dual Set of Linear Programming Games
• A direct linear programming algorithm for solving matrix games
• A global convergence theorem for aggregation algorithms
• Aggregation bounds in stochastic linear programming
• scientific article; zbMATH DE number 4102817

Cited in

(2)

• Aggregating sets of von Neumann-Morgenstern utilities
• scientific article; zbMATH DE number 4087417 (Why is no real title available?)

This page was built for publication: Aggregation in linear programming and in matrix games

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