Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Chi-Kit Lam"'
Autor:
Chi-Kit Lam, C. Gregory Plaxton
Publikováno v:
Theory of Computing Systems. 66:645-678
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e3ae9a41675828074dedaaeacb65a36
https://doi.org/10.1007/s00224-022-10072-1
https://doi.org/10.1007/s00224-022-10072-1
Autor:
Chi-Kit Lam, C. Gregory Plaxton
Publikováno v:
Theory of Computing Systems. 66:679-695
We study the three-dimensional stable matching problem with cyclic preferences. This model involves three types of agents, with an equal number of agents of each type. The types form a cyclic order such that each agent has a complete preference list
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::217d027ca0363d29c68936c451498685
https://doi.org/10.1007/s00224-021-10055-8
https://doi.org/10.1007/s00224-021-10055-8
Autor:
C. Gregory Plaxton, Chi-Kit Lam
Publikováno v:
Algorithmic Game Theory ISBN: 9783030304720
SAGT
SAGT
We study the problem of finding maximum weakly stable matchings when preference lists are incomplete and contain one-sided ties of bounded length. We show that if the tie length is at most L, then it is possible to achieve an approximation ratio of \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::511cfd0bdbe9f1115ff9d445aa52a53e
https://doi.org/10.1007/978-3-030-30473-7_23
https://doi.org/10.1007/978-3-030-30473-7_23
Autor:
C. Gregory Plaxton, Chi-Kit Lam
Publikováno v:
Algorithmic Game Theory ISBN: 9783030304720
SAGT
SAGT
We study the three-dimensional stable matching problem with cyclic preferences. This model involves three types of agents, with an equal number of agents of each type. The types form a cyclic order such that each agent has a complete preference list
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0af89b7891dd1b4e57604a760ec024eb
https://doi.org/10.1007/978-3-030-30473-7_22
https://doi.org/10.1007/978-3-030-30473-7_22
Publikováno v:
Algorithmic Game Theory ISBN: 9783319666990
SAGT
SAGT
We study the variant of the stable marriage problem in which the preferences of the agents are allowed to include indifferences. We present a mechanism for producing Pareto-stable matchings in stable marriage markets with indifferences that is group
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::213c12a2224a97ddd189c73bb6475b80
https://doi.org/10.1007/978-3-319-66700-3_22
https://doi.org/10.1007/978-3-319-66700-3_22
Autor:
Siu-Wing Cheng, Chi-Kit Lam
Publikováno v:
Computational Geometry. 46:591-603
We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1269d6bd910609a9ffea3a704121e213
https://doi.org/10.1016/j.comgeo.2013.01.002
https://doi.org/10.1016/j.comgeo.2013.01.002