Core Stable Algorithms for Coalition Games with Complementarities and Peer Effects

In this short 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 match...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation review 2015-11, Vol.43 (3), p.72-75
Main Authors: Touati, Mikael, El-Azouzi, Rachid, Coupechoux, Marceau, Altman, Eitan, Kelif, Jean-Marc
Format: Article
Language:English
Subjects:
Computer Science
Networking and Internet Architecture
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this short 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.
ISSN:0163-5999
DOI:10.1145/2847220.2847244