# Selection-based Approach to Cooperative Interval Games

arXiv: https://arxiv.org/abs/1410.3877 · HTML: https://mlsanity.com/paper/1410.3877/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Oct 2014.

## Built on by (most cited first, 1 of 1)

- [Meta-Learning in Self-Play Regret Minimization](https://mlsanity.com/paper/2504.18917/) (2025)

## Abstract (arXiv)

Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of the interval game with no additional uncertainty. We introduce new selection-based classes of interval games and prove their characterization theorems and relations to existing classes based on the interval weakly better operator. We show new results regarding the core and imputations and examine a problem of equivalence for two different versions of the core, the main stability solution of cooperative games. Finally, we introduce the definition of strong imputation and strong core as universal solution concepts of interval games.