Facility location with Minimax envy
We study the problem of locating a public facility on a real line or an interval, when agents’ costs are their (expected) distances from the location of the facility. Our goal is to minimize the maximum envy over all agents, which we will refer to as the minimax envy objective, while at the same tim...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2016
|