Name
Abstract | ||
|---|---|---|
We consider problems where a solution is evaluated with a couple. Each coordinate of this couple represents an agent's utility. Due to the possible conflicts, it is unlikely that one feasible solution is optimal for both agents. Then, a natural aim is to find tradeoffs. We investigate tradeoff solutions with guarantees for the agents. The focus is on discrete problems having a matroid structure. We provide polynomial-time deterministic algorithms which achieve several guarantees and we prove that some guarantees are not possible to reach. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3233/978-1-61499-098-7-360 | Frontiers in Artificial Intelligence and Applications |
Keywords | Field | DocType |
matroids | Matroid,Mathematical optimization,Computer science | Conference |
Volume | ISSN | Citations |
242 | 0922-6389 | 1 |
PageRank | References | Authors |
0.35 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Gourvès | 1 | 241 | 30.97 |
| Jérôme Monnot | 2 | 512 | 55.74 |
| Lydia Tlilane | 3 | 23 | 2.93 |