A minimax version of Ptak's combinatorial lemma

DOI10.1016/0022-247X(83)90073-2zbMATH Open0527.49007WikidataQ124829589 ScholiaQ124829589MaRDI QIDQ786387FDOQ786387

Authors: Jürgen Kindler 

Publication date: 1983

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

minimax theoremcombinatorial lemma

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial inequalities (05A20) Existence of solutions for minimax problems (49J35)

Cites Work

• Bemerkungen zum von Neumannschen Minimaxtheorem
• Title not available (Why is that?)
• Minimaxtheoreme für die diskrete gemischte erweiterung von spielen und ein approximationssatz¹
• Title not available (Why is that?)
• Über ein minimaxtheorem von young
• Title not available (Why is that?)
• Admixtures of Two-Person Games

Cited In (3)

• An uncountable version of Pták's combinatorial lemma
• An elementary minimax inequality
• A general saddle point theorem and its applications

This page was built for publication: A minimax version of Ptak's combinatorial lemma

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