Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kasl, Tomáš"'
Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite programming. In gen
Externí odkaz:
http://arxiv.org/abs/2009.12185
Autor:
Kasl, Tomáš
Constraint hierarchies belong to techniques for solving over-constrained problems, that is, constraint satisfaction problems where it is not possible to satisfy all the constraints. The idea of constraint hierarchy is to label each constraint by a pr
Externí odkaz:
http://www.nusl.cz/ntk/nusl-265890
Autor:
Kasl, Tomáš
Constraint hierarchies belong to techniques for solving over-constrained problems, that is, constraint satisfaction problems where it is not possible to satisfy all the constraints. The idea of constraint hierarchy is to label each constraint by a pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a97a745b7cec928f7e2f1a32e50b1e79
http://www.nusl.cz/ntk/nusl-459125
http://www.nusl.cz/ntk/nusl-459125