Truthful allocation in graphs and hypergraphs
We study truthful mechanisms for allocation problems in graphs, both for the minimization (i.e., scheduling) and maximization (i.e., auctions) setting. The minimization problem is a special case of the well-studied unrelated machines scheduling problem, in which every given task can be executed only...
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Conference item |
| Hizkuntza: | English |
| Argitaratua: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021
|