A generalization of von Neumann's assignment problem and K. Fan optimization result |
| |
| Authors: | Ezio Marchi Pablo Tarazaga |
| |
| Affiliation: | (1) IMECC, UNICAMP, Campinas, S.P., Brasil;(2) University of San Luis, San Luis, Argentina |
| |
| Abstract: | ![]()
Summary In this paper we generalize the assignment problem in higher dimensions, referring at to another study by the authors. The hide-and-seek game, which is intimately related to the assignment problem, is extended, and an elegant result due to K. Fan about extrema is generalized. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
