Core stable algorithms for coalition games with complementarities and peer effects

Mikael Touati; Rachid El-Azouzi; Marceau Coupechoux; Eitan Altman; Jean Marc Kelif

doi:10.1145/2847220.2847244

Core stable algorithms for coalition games with complementarities and peer effects

Mikael Touati
, Rachid El-Azouzi
, Marceau Coupechoux
, Eitan Altman
, Jean Marc Kelif

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	72-75
Number of pages	4
Journal	Performance Evaluation Review
Volume	43
Issue number	3
DOIs	https://doi.org/10.1145/2847220.2847244
Publication status	Published - 1 Dec 2015

Access to Document

10.1145/2847220.2847244

Cite this

@article{7fcaacb10d844ecba1d4a95ea5f725c6,

title = "Core stable algorithms for coalition games with complementarities and peer effects",

abstract = "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.",

author = "Mikael Touati and Rachid El-Azouzi and Marceau Coupechoux and Eitan Altman and Kelif, \{Jean Marc\}",

note = "Publisher Copyright: Copyright is held by author/owner(s).",

year = "2015",

month = dec,

day = "1",

doi = "10.1145/2847220.2847244",

language = "English",

volume = "43",

pages = "72--75",

journal = "Performance Evaluation Review",

issn = "0163-5999",

number = "3",

}

TY - JOUR

T1 - Core stable algorithms for coalition games with complementarities and peer effects

AU - Touati, Mikael

AU - El-Azouzi, Rachid

AU - Coupechoux, Marceau

AU - Altman, Eitan

AU - Kelif, Jean Marc

N1 - Publisher Copyright: Copyright is held by author/owner(s).

PY - 2015/12/1

Y1 - 2015/12/1

N2 - 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.

AB - 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.

U2 - 10.1145/2847220.2847244

DO - 10.1145/2847220.2847244

M3 - Article

AN - SCOPUS:84997355285

SN - 0163-5999

VL - 43

SP - 72

EP - 75

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 3

ER -

Core stable algorithms for coalition games with complementarities and peer effects

Abstract

Access to Document

Fingerprint

Cite this