SoCS 2019
Algorithms for Average Regret Minimization
Abstract
In this paper, we study a problem from the realm of multi-criteria decision making in which the goal is to select from a given set S of d-dimensional objects a minimum sized subset S
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Symposium on Combinatorial Search
- Archive span
- 2010-2024
- Indexed papers
- 598
- Paper id
- 260816887414649812