Zobrazeno 1 - 10
of 416
pro vyhledávání: '"HSU, KEVIN"'
Autor:
Hsu, Kevin
We study the fair division of multigraphs with self-loops. In this setting, vertices represent agents and edges represent goods, and a good provides positive utility to an agent only if it is incident with the agent. Whereas previous research has so
Externí odkaz:
http://arxiv.org/abs/2410.12039
We consider a large-scale multi-robot path planning problem in a cluttered environment. Our approach achieves real-time replanning by dividing the workspace into cells and utilizing a hierarchical planner. Specifically, we propose novel multi-commodi
Externí odkaz:
http://arxiv.org/abs/2407.02777
Autor:
Hsu, Kevin
Maximin share (MMS) allocations are a popular relaxation of envy-free allocations that have received wide attention in the fair division of indivisible items. Although MMS allocations of goods can fail to exist, previous work has found conditions und
Externí odkaz:
http://arxiv.org/abs/2401.07490
Autor:
Hsu, Kevin
The problem of fair division of indivisible goods has been receiving much attention recently. The prominent metric of envy-freeness can always be satisfied in the divisible goods setting (see for example \cite{BT95}), but often cannot be satisfied in
Externí odkaz:
http://arxiv.org/abs/2209.06330
Autor:
Hsu, Kevin
The orientation completion problem for a hereditary class C of oriented graphs asks whether a given partially oriented graph can be completed to a graph belonging to C. This problem was introduced recently and is a generalization of several existing
Externí odkaz:
http://hdl.handle.net/1828/12024
Autor:
Hsu, Kevin, Huang, Jing
The orientation completion problem for a class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class by orienting the unoriented edges of the partially oriented graph. Orientation completi
Externí odkaz:
http://arxiv.org/abs/2102.11475
Autor:
Letkiewicz, Allison M., Li, Lilian Y., Hoffman, Lija M.K., Lieberman, Lynne, Hsu, Kevin J., Shankman, Stewart A.
Publikováno v:
In International Journal of Psychophysiology February 2024 196
Autor:
Hsu, Kevin, Huang, Jing
The orientation completion problem for a fixed class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class. Orientation completion problems have been studied recently for several classes o
Externí odkaz:
http://arxiv.org/abs/2008.07104
Autor:
Hsu, Kevin(Kevin Ta-Zhi)
Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, 2019, In conjunction with the Leaders for Global Operations Program at MIT
Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineeri
Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineeri
Externí odkaz:
https://hdl.handle.net/1721.1/122590