Computing a payoff division in the least core for MC-nets coalitional games

Katsutoshi Hirayama, Kenta Hanada, Suguru Ueda, Makoto Yokoo, Atsushi Iwasaki

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

1 Citation (Scopus)

Abstract

MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given aMC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.

Original languageEnglish
Title of host publicationPRIMA 2014
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 17th International Conference, Proceedings
EditorsYang Xu, Jeremy Pitt, Hoa Khanh Dam, Guido Governatori, Takayuki Ito
PublisherSpringer Verlag
Pages319-332
Number of pages14
ISBN (Electronic)9783319131900
Publication statusPublished - Jan 1 2014
Event17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014 - Gold Coast, Australia
Duration: Dec 1 2014Dec 5 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8861
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014
CountryAustralia
CityGold Coast
Period12/1/1412/5/14

Fingerprint

Coalitional Games
Division
Computing
Data storage equipment
Linear programming
Characteristic Function
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hirayama, K., Hanada, K., Ueda, S., Yokoo, M., & Iwasaki, A. (2014). Computing a payoff division in the least core for MC-nets coalitional games. In Y. Xu, J. Pitt, H. K. Dam, G. Governatori, & T. Ito (Eds.), PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings (pp. 319-332). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8861). Springer Verlag.

Computing a payoff division in the least core for MC-nets coalitional games. / Hirayama, Katsutoshi; Hanada, Kenta; Ueda, Suguru; Yokoo, Makoto; Iwasaki, Atsushi.

PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. ed. / Yang Xu; Jeremy Pitt; Hoa Khanh Dam; Guido Governatori; Takayuki Ito. Springer Verlag, 2014. p. 319-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8861).

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

Hirayama, K, Hanada, K, Ueda, S, Yokoo, M & Iwasaki, A 2014, Computing a payoff division in the least core for MC-nets coalitional games. in Y Xu, J Pitt, HK Dam, G Governatori & T Ito (eds), PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8861, Springer Verlag, pp. 319-332, 17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014, Gold Coast, Australia, 12/1/14.
Hirayama K, Hanada K, Ueda S, Yokoo M, Iwasaki A. Computing a payoff division in the least core for MC-nets coalitional games. In Xu Y, Pitt J, Dam HK, Governatori G, Ito T, editors, PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Springer Verlag. 2014. p. 319-332. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hirayama, Katsutoshi ; Hanada, Kenta ; Ueda, Suguru ; Yokoo, Makoto ; Iwasaki, Atsushi. / Computing a payoff division in the least core for MC-nets coalitional games. PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. editor / Yang Xu ; Jeremy Pitt ; Hoa Khanh Dam ; Guido Governatori ; Takayuki Ito. Springer Verlag, 2014. pp. 319-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{558805d0263544ceaf9fc22bdbfd1008,
title = "Computing a payoff division in the least core for MC-nets coalitional games",
abstract = "MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given aMC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.",
author = "Katsutoshi Hirayama and Kenta Hanada and Suguru Ueda and Makoto Yokoo and Atsushi Iwasaki",
year = "2014",
month = "1",
day = "1",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "319--332",
editor = "Yang Xu and Jeremy Pitt and Dam, {Hoa Khanh} and Guido Governatori and Takayuki Ito",
booktitle = "PRIMA 2014",
address = "Germany",

}

TY - GEN

T1 - Computing a payoff division in the least core for MC-nets coalitional games

AU - Hirayama, Katsutoshi

AU - Hanada, Kenta

AU - Ueda, Suguru

AU - Yokoo, Makoto

AU - Iwasaki, Atsushi

PY - 2014/1/1

Y1 - 2014/1/1

N2 - MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given aMC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.

AB - MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given aMC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.

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

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

M3 - Conference contribution

AN - SCOPUS:84910144738

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 319

EP - 332

BT - PRIMA 2014

A2 - Xu, Yang

A2 - Pitt, Jeremy

A2 - Dam, Hoa Khanh

A2 - Governatori, Guido

A2 - Ito, Takayuki

PB - Springer Verlag

ER -