Handling negative value rules in MC-net-based coalition structure generation

Suguru Ueda, Takato Hasegawa, Naoyuki Hashimoto, Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo

Research output: Contribution to conferencePaper

5 Citations (Scopus)

Abstract

A Coalition Structure Generation (CSG) problem involves partitioning a set of agents into coalitions so that the social surplus is maximized. Recently, Ohta et al. developed an efficient algorithm for solving CSG assuming that a characteristic function is represented by a set of rules, such as marginal contribution networks (MC-nets). In this paper, we extend the formalization of CSG in Ohta et al. so that it can handle negative value rules. Here, we assume that a characteristic function is represented by either MC-nets (without externalities) or embedded MC-nets (with externalities). Allowing negative value rules is important since it can reduce the efforts for describing a characteristic function. In particular, in many realistic situations, it is natural to assume that a coalition has negative externalities to other coalitions. To handle negative value rules, we examine the following three algorithms: (i) a full transformation algorithm, (ii) a partial transformation algorithm, and (iii) a direct encoding algorithm. We show that the full transformation algorithm is not scalable in MC-nets (the worst-case representation size is Ω(n2), where n is the number of agents), and does not seem to be tractable in embedded MC-nets (representation size would be Ω(2n)). In contrast, by using the partial transformation or direct encoding algorithms, an exponential blow-up never occurs even for embedded MC-nets. For embedded MC-nets, the direct encoding algorithm creates less rules than the partial transformation algorithm. Experimental evaluations show that the direct encoding algorithm is scalable, i.e., an off-the-shelf optimization package (CPLEX) can solve problem instances with 100 agents and rules within 10 seconds.

Original languageEnglish
Pages184-191
Number of pages8
Publication statusPublished - Jan 1 2012
Event11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 - Valencia, Spain
Duration: Jun 4 2012Jun 8 2012

Other

Other11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012
CountrySpain
CityValencia
Period6/4/126/8/12

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Ueda, S., Hasegawa, T., Hashimoto, N., Ohta, N., Iwasaki, A., & Yokoo, M. (2012). Handling negative value rules in MC-net-based coalition structure generation. 184-191. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.

Handling negative value rules in MC-net-based coalition structure generation. / Ueda, Suguru; Hasegawa, Takato; Hashimoto, Naoyuki; Ohta, Naoki; Iwasaki, Atsushi; Yokoo, Makoto.

2012. 184-191 Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.

Research output: Contribution to conferencePaper

Ueda, S, Hasegawa, T, Hashimoto, N, Ohta, N, Iwasaki, A & Yokoo, M 2012, 'Handling negative value rules in MC-net-based coalition structure generation', Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain, 6/4/12 - 6/8/12 pp. 184-191.
Ueda S, Hasegawa T, Hashimoto N, Ohta N, Iwasaki A, Yokoo M. Handling negative value rules in MC-net-based coalition structure generation. 2012. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.
Ueda, Suguru ; Hasegawa, Takato ; Hashimoto, Naoyuki ; Ohta, Naoki ; Iwasaki, Atsushi ; Yokoo, Makoto. / Handling negative value rules in MC-net-based coalition structure generation. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.8 p.
@conference{8690eb240c234ef3aaf3dc6dae5ae075,
title = "Handling negative value rules in MC-net-based coalition structure generation",
abstract = "A Coalition Structure Generation (CSG) problem involves partitioning a set of agents into coalitions so that the social surplus is maximized. Recently, Ohta et al. developed an efficient algorithm for solving CSG assuming that a characteristic function is represented by a set of rules, such as marginal contribution networks (MC-nets). In this paper, we extend the formalization of CSG in Ohta et al. so that it can handle negative value rules. Here, we assume that a characteristic function is represented by either MC-nets (without externalities) or embedded MC-nets (with externalities). Allowing negative value rules is important since it can reduce the efforts for describing a characteristic function. In particular, in many realistic situations, it is natural to assume that a coalition has negative externalities to other coalitions. To handle negative value rules, we examine the following three algorithms: (i) a full transformation algorithm, (ii) a partial transformation algorithm, and (iii) a direct encoding algorithm. We show that the full transformation algorithm is not scalable in MC-nets (the worst-case representation size is Ω(n2), where n is the number of agents), and does not seem to be tractable in embedded MC-nets (representation size would be Ω(2n)). In contrast, by using the partial transformation or direct encoding algorithms, an exponential blow-up never occurs even for embedded MC-nets. For embedded MC-nets, the direct encoding algorithm creates less rules than the partial transformation algorithm. Experimental evaluations show that the direct encoding algorithm is scalable, i.e., an off-the-shelf optimization package (CPLEX) can solve problem instances with 100 agents and rules within 10 seconds.",
author = "Suguru Ueda and Takato Hasegawa and Naoyuki Hashimoto and Naoki Ohta and Atsushi Iwasaki and Makoto Yokoo",
year = "2012",
month = "1",
day = "1",
language = "English",
pages = "184--191",
note = "11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 ; Conference date: 04-06-2012 Through 08-06-2012",

}

TY - CONF

T1 - Handling negative value rules in MC-net-based coalition structure generation

AU - Ueda, Suguru

AU - Hasegawa, Takato

AU - Hashimoto, Naoyuki

AU - Ohta, Naoki

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

PY - 2012/1/1

Y1 - 2012/1/1

N2 - A Coalition Structure Generation (CSG) problem involves partitioning a set of agents into coalitions so that the social surplus is maximized. Recently, Ohta et al. developed an efficient algorithm for solving CSG assuming that a characteristic function is represented by a set of rules, such as marginal contribution networks (MC-nets). In this paper, we extend the formalization of CSG in Ohta et al. so that it can handle negative value rules. Here, we assume that a characteristic function is represented by either MC-nets (without externalities) or embedded MC-nets (with externalities). Allowing negative value rules is important since it can reduce the efforts for describing a characteristic function. In particular, in many realistic situations, it is natural to assume that a coalition has negative externalities to other coalitions. To handle negative value rules, we examine the following three algorithms: (i) a full transformation algorithm, (ii) a partial transformation algorithm, and (iii) a direct encoding algorithm. We show that the full transformation algorithm is not scalable in MC-nets (the worst-case representation size is Ω(n2), where n is the number of agents), and does not seem to be tractable in embedded MC-nets (representation size would be Ω(2n)). In contrast, by using the partial transformation or direct encoding algorithms, an exponential blow-up never occurs even for embedded MC-nets. For embedded MC-nets, the direct encoding algorithm creates less rules than the partial transformation algorithm. Experimental evaluations show that the direct encoding algorithm is scalable, i.e., an off-the-shelf optimization package (CPLEX) can solve problem instances with 100 agents and rules within 10 seconds.

AB - A Coalition Structure Generation (CSG) problem involves partitioning a set of agents into coalitions so that the social surplus is maximized. Recently, Ohta et al. developed an efficient algorithm for solving CSG assuming that a characteristic function is represented by a set of rules, such as marginal contribution networks (MC-nets). In this paper, we extend the formalization of CSG in Ohta et al. so that it can handle negative value rules. Here, we assume that a characteristic function is represented by either MC-nets (without externalities) or embedded MC-nets (with externalities). Allowing negative value rules is important since it can reduce the efforts for describing a characteristic function. In particular, in many realistic situations, it is natural to assume that a coalition has negative externalities to other coalitions. To handle negative value rules, we examine the following three algorithms: (i) a full transformation algorithm, (ii) a partial transformation algorithm, and (iii) a direct encoding algorithm. We show that the full transformation algorithm is not scalable in MC-nets (the worst-case representation size is Ω(n2), where n is the number of agents), and does not seem to be tractable in embedded MC-nets (representation size would be Ω(2n)). In contrast, by using the partial transformation or direct encoding algorithms, an exponential blow-up never occurs even for embedded MC-nets. For embedded MC-nets, the direct encoding algorithm creates less rules than the partial transformation algorithm. Experimental evaluations show that the direct encoding algorithm is scalable, i.e., an off-the-shelf optimization package (CPLEX) can solve problem instances with 100 agents and rules within 10 seconds.

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

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

M3 - Paper

AN - SCOPUS:84899459730

SP - 184

EP - 191

ER -