![]() |
![]() |
University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Two-sided max-linear systems, game theory and the assignment problem.
Two-sided max-linear systems, game theory and the assignment problem.Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Sergey Sergeev. We define the two-sided max-linear system and we discuss real-life situations in which one may be interested in solving such systems. Interestingly, such systems lie in the complexity class NP intersect co-NP, one consequence of this is that it is not known whether the problem is polynomially solvable or not. We briefly discuss why such systems may be of interest in the game theory community – discussing connections with mean-payoff games. Finally, we show a surprising connection with the (polynomially solvable) assignment problem (AP). Is it possible that the AP could eventually be the key tool in solving two-sided max-linear systems? This talk is part of the Optimisation and Numerical Analysis Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCargo Computer Science Departmental Series Bham TalksOther talksProvably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Topological magnons and quantum magnetism [Friday seminar]: Irradiated brown dwarfs in the desert Signatures of structural criticality and universality in the cellular anatomy of the brain The percolating cluster is invisible to image recognition with deep learning |