A generalization of von Neumann's assignment problem and K. Fan's optimization result

DOI10.1007/BF01762133zbMath0476.90043OpenAlexW2048697544MaRDI QIDQ1160077

Pablo Tarazaga, Ezio Marchi

Publication date: 1981

Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762133

zbMATH Keywords

assignment problemdoubly stochastic matriceshide-and-seek gamehigher dimensional generalization

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Stochastic matrices (15B51)

Related Items (1)

About \((k, n)\) stochastic matrices

Cites Work

• About \((k, n)\) stochastic matrices
• Applications of a theorem concerning sets with convex sections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of von Neumann's assignment problem and K. Fan's optimization result