Profils utilisateurs correspondant à "Natig Tofigzade"
 | Natig TofigzadeMMath graduate of University of Waterloo Adresse e-mail validée de uwaterloo.ca |
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
N Tofigzade - 2020 - uwspace.uwaterloo.ca
In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B
represent disjoint groups of agents, each of whom has ordinal preferences over the …
represent disjoint groups of agents, each of whom has ordinal preferences over the …
Approximating Stable Matchings with Ties of Bounded Size
Finding a stable matching is one of the central problems in algorithmic game theory. If
participants are allowed to have ties and incomplete lists, computing a stable matching of …
participants are allowed to have ties and incomplete lists, computing a stable matching of …
Algorithmic Game Theory LNCS 12283
… Natig Tofigzade. The program included three invited talks by leading researchers in the
field: Dirk Bergemann (Yale University, USA), Paul Dütting (London School of Economics, UK), …
field: Dirk Bergemann (Yale University, USA), Paul Dütting (London School of Economics, UK), …
[LIVRE][B] Algorithmic Game Theory: 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16–18, 2020, Proceedings
… Natig Tofigzade. The program included three invited talks by leading researchers in the
field: Dirk Bergemann (Yale University, USA), Paul Dütting (London School of Economics, UK), …
field: Dirk Bergemann (Yale University, USA), Paul Dütting (London School of Economics, UK), …