Optimally Selecting Representative Agents from a Metric Space
It is shown that this lower bound is tight and that a clustering in the $2$-Droop core always exists, and that such a clustering can be achieved by only selecting centers from locations in the metric space where an agent resides.
Benjamin Cookson, E. Deltl, Y. Oh
· 0 citations