4 papers · 1 filter
Graph Coloring with Color Preferences
Tomohiro Koana, Yeeseok Oh, Hirotaka Yoneda
We study graph coloring with color preferences, in which each vertex ranks the available colors. In addition to assigning different colors to adjacent vertices, we require the colo…
Optimally Selecting Representative Agents from a Metric Space
Benjamin Cookson, Eva Deltl, Yeeseok Oh
This paper studies the problem of proportionally fair clustering, where the goal is to select ``centers'' from a metric space that fairly represent a set of agents who also lie…
Candidate Resignation Monotonicity in Approval-Based Committee Elections
Yeeseok Oh, Dominik Peters
Approval-based committee (ABC) elections select a fixed-size committee of candidates based on voters' approval preferences. We study a setting where elected members may resign and…
Improved Lower Bounds for Proportionally Fair Clustering
Benjamin Cookson, Eva Deltl, Yeeseok Oh
We study proportionally fair clustering, where a set of centers must be chosen from a metric space to represent agents, and no sufficiently large group of agents should be…