Core stable algorithms for coalition games with complementarities and peer effects
Résumé
In this paper, we show two new algorithms for finding stable structures in ordinal coalition potential games. The first one is anytime and enumerative. It performs on a graph. The second one is a modified Deferred Acceptance Algorithm (DAA) using counter-proposals. It finds a many-to-one matching. We illustrate with the example of video caching from a content creator’s servers to a service provider’s servers.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...