Finding the core for coalition structure utilizing dual solution

Atsushi Iwasaki, Suguru Ueda, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

When forming the grand coalition is not possible/optimal, agents need to create a coalition structure. The idea of the core can be extended to such a case. In this paper, we propose an innovative algorithm called CoreD to check core-non-emptiness for coalition structures. A more straightforward algorithm based on existing techniques, which we call CoreP, first obtains the value of optimal coalition structure by solving an integer programming problem. Then, it checks whether that value can be divided without making a blocking (dissatisfied) coalition. In contrast, CoreD first finds a minimal amount value of optimal coalition structure so that there exists no blocking coalition. Then, it checks whether the optimal value can be equal to the minimal value. We empirically show that when the core is empty, CoreD is by far superior to CoreP. Also, to find a second-best payoff vector when the core is empty, we propose a new solution concept called the weak ε-core+, which can utilize the approximate value of the optimal coalition structure. Based on the idea of CoreD, we further develop an algorithm for checking the non-emptiness of the weak ε-core+.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013
PublisherIEEE Computer Society
Pages114-121
Number of pages8
Volume2
ISBN (Print)9781479929023
DOIs
Publication statusPublished - 2013
Event2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013 - Atlanta, GA, United States
Duration: Nov 17 2013Nov 20 2013

Other

Other2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013
CountryUnited States
CityAtlanta, GA
Period11/17/1311/20/13

Fingerprint

Integer programming

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Iwasaki, A., Ueda, S., & Yokoo, M. (2013). Finding the core for coalition structure utilizing dual solution. In Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013 (Vol. 2, pp. 114-121). [6690779] IEEE Computer Society. https://doi.org/10.1109/WI-IAT.2013.99

Finding the core for coalition structure utilizing dual solution. / Iwasaki, Atsushi; Ueda, Suguru; Yokoo, Makoto.

Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013. Vol. 2 IEEE Computer Society, 2013. p. 114-121 6690779.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Iwasaki, A, Ueda, S & Yokoo, M 2013, Finding the core for coalition structure utilizing dual solution. in Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013. vol. 2, 6690779, IEEE Computer Society, pp. 114-121, 2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013, Atlanta, GA, United States, 11/17/13. https://doi.org/10.1109/WI-IAT.2013.99
Iwasaki A, Ueda S, Yokoo M. Finding the core for coalition structure utilizing dual solution. In Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013. Vol. 2. IEEE Computer Society. 2013. p. 114-121. 6690779 https://doi.org/10.1109/WI-IAT.2013.99
Iwasaki, Atsushi ; Ueda, Suguru ; Yokoo, Makoto. / Finding the core for coalition structure utilizing dual solution. Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013. Vol. 2 IEEE Computer Society, 2013. pp. 114-121
@inproceedings{30e1cd6cc79e475fbc024b96cacc6cab,
title = "Finding the core for coalition structure utilizing dual solution",
abstract = "When forming the grand coalition is not possible/optimal, agents need to create a coalition structure. The idea of the core can be extended to such a case. In this paper, we propose an innovative algorithm called CoreD to check core-non-emptiness for coalition structures. A more straightforward algorithm based on existing techniques, which we call CoreP, first obtains the value of optimal coalition structure by solving an integer programming problem. Then, it checks whether that value can be divided without making a blocking (dissatisfied) coalition. In contrast, CoreD first finds a minimal amount value of optimal coalition structure so that there exists no blocking coalition. Then, it checks whether the optimal value can be equal to the minimal value. We empirically show that when the core is empty, CoreD is by far superior to CoreP. Also, to find a second-best payoff vector when the core is empty, we propose a new solution concept called the weak ε-core+, which can utilize the approximate value of the optimal coalition structure. Based on the idea of CoreD, we further develop an algorithm for checking the non-emptiness of the weak ε-core+.",
author = "Atsushi Iwasaki and Suguru Ueda and Makoto Yokoo",
year = "2013",
doi = "10.1109/WI-IAT.2013.99",
language = "English",
isbn = "9781479929023",
volume = "2",
pages = "114--121",
booktitle = "Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013",
publisher = "IEEE Computer Society",
address = "United States",

}

TY - GEN

T1 - Finding the core for coalition structure utilizing dual solution

AU - Iwasaki, Atsushi

AU - Ueda, Suguru

AU - Yokoo, Makoto

PY - 2013

Y1 - 2013

N2 - When forming the grand coalition is not possible/optimal, agents need to create a coalition structure. The idea of the core can be extended to such a case. In this paper, we propose an innovative algorithm called CoreD to check core-non-emptiness for coalition structures. A more straightforward algorithm based on existing techniques, which we call CoreP, first obtains the value of optimal coalition structure by solving an integer programming problem. Then, it checks whether that value can be divided without making a blocking (dissatisfied) coalition. In contrast, CoreD first finds a minimal amount value of optimal coalition structure so that there exists no blocking coalition. Then, it checks whether the optimal value can be equal to the minimal value. We empirically show that when the core is empty, CoreD is by far superior to CoreP. Also, to find a second-best payoff vector when the core is empty, we propose a new solution concept called the weak ε-core+, which can utilize the approximate value of the optimal coalition structure. Based on the idea of CoreD, we further develop an algorithm for checking the non-emptiness of the weak ε-core+.

AB - When forming the grand coalition is not possible/optimal, agents need to create a coalition structure. The idea of the core can be extended to such a case. In this paper, we propose an innovative algorithm called CoreD to check core-non-emptiness for coalition structures. A more straightforward algorithm based on existing techniques, which we call CoreP, first obtains the value of optimal coalition structure by solving an integer programming problem. Then, it checks whether that value can be divided without making a blocking (dissatisfied) coalition. In contrast, CoreD first finds a minimal amount value of optimal coalition structure so that there exists no blocking coalition. Then, it checks whether the optimal value can be equal to the minimal value. We empirically show that when the core is empty, CoreD is by far superior to CoreP. Also, to find a second-best payoff vector when the core is empty, we propose a new solution concept called the weak ε-core+, which can utilize the approximate value of the optimal coalition structure. Based on the idea of CoreD, we further develop an algorithm for checking the non-emptiness of the weak ε-core+.

UR - http://www.scopus.com/inward/record.url?scp=84893264053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893264053&partnerID=8YFLogxK

U2 - 10.1109/WI-IAT.2013.99

DO - 10.1109/WI-IAT.2013.99

M3 - Conference contribution

AN - SCOPUS:84893264053

SN - 9781479929023

VL - 2

SP - 114

EP - 121

BT - Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013

PB - IEEE Computer Society

ER -