The theory of maximal social welfare feasible coalition
| dc.contributor.author | Boongasame, Laor | |
| dc.contributor.author | Boonjing, Veera | |
| dc.contributor.author | Leung, Ho Fung | |
| dc.date.accessioned | 2026-08-06T09:55:05Z | |
| dc.date.available | 2026-08-06T09:55:05Z | |
| dc.date.issued | 2007-01-01 | |
| dc.description.abstract | This paper proposes a new theory for forming a maximumvalue-cooperation coalition known as the Maximal Social Welfare Feasible Coalition. This theory can give such solution because it does not assume that each player requesting to join a coalition knows information of other players. However, all players' private information requesting to join the coalition is known by an honest coordinator. This allows the coordinator to select a coalition structure with maximal value of cooperation among successful players so as they get at least at their required minimum values. Not only this maximal value is shown to be equal to or larger than the value of a core coalition but also the value allocation is shown to be Pareto optimal. © Springer-Verlag Berlin Heidelberg 2007. | |
| dc.identifier.citation | Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 4570 LNAI, 935-942, 2007 | |
| dc.identifier.doi | 10.1007/978-3-540-73325-6_93 | |
| dc.identifier.issn | 03029743 | |
| dc.identifier.other | 2-s2.0-37249065232 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/1573 | |
| dc.source | Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics | |
| dc.subject | Coalition formation | |
| dc.subject | Cooperative game theory | |
| dc.subject | Group buying | |
| dc.subject | Pareto optimally | |
| dc.subject | The core | |
| dc.title | The theory of maximal social welfare feasible coalition | |
| dc.type | Conference Paper |
