Author of the publication

Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game.

, , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 280-291. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences., and . Theory Comput. Syst., 66 (3): 679-695 (2022)Strategyproof Pareto-Stable Mechanisms for Two-Sided Matching with Indifferences., , and . CoRR, (2017)Shape matching under rigid motion., and . Comput. Geom., 46 (6): 591-603 (2013)Maximum Stable Matching with One-Sided Ties of Bounded Length., and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 343-356. Springer, (2019)On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences., and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 329-342. Springer, (2019)Maximum Stable Matching with One-Sided Ties of Bounded Length., and . Theory Comput. Syst., 66 (3): 645-678 (2022)A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists., and . SODA, page 2823-2840. SIAM, (2019)Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game., , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 280-291. Springer, (2017)Bipartite Matching with Linear Edge Weights., , and . ISAAC, volume 64 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)