Abstract
This study analyzes von Neumann-Morgenstern stable sets in an assignment game. Núñez and Rafels (2013) have shown that the union of the extended cores of all μ-compatible subgames is a stable set. Typically, the set of all μ-compatible subgames includes many elements, most of which are inessential for obtaining the stable set. We provide an algorithm to find a set of μ-compatible subgames for obtaining the stable set when the valuation matrix is positive. Moreover, this algorithm finds the minimum set of μ-compatible subgames for obtaining the stable set when each column and row in the valuation matrix is constituted from different positive numbers. Our simulation result reveals that the average size of the minimum set of μ-compatible subgames for obtaining the stable set is significantly lower than that of the set of all μ-compatible subgames.
| Original language | English |
|---|---|
| Pages (from-to) | 231-252 |
| Number of pages | 22 |
| Journal | International Journal of Game Theory |
| Volume | 52 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2023 Mar |
| Externally published | Yes |
Keywords
- Assignment game
- stable set
- μ-compatible subgames
ASJC Scopus subject areas
- Statistics and Probability
- Mathematics (miscellaneous)
- Social Sciences (miscellaneous)
- Economics and Econometrics
- Statistics, Probability and Uncertainty