Geodesic
How to arrange a singles’ party: coalition formation in matching game
Contributions to game theory and management, Tome 7 (2014), pp. 221-238

Voir la notice de l'article provenant de la source Math-Net.Ru

The study addresses important issues relating to computational aspects of coalition formation. However, finding payoffs$-$imputations belonging to the core$-$is, while almost as well known, an overly complex, NP-hard problem, even for modern supercomputers. The issue becomes uncertain because, among other issues, it is unknown whether the core is non-empty. In the proposed cooperative game, under the name of singles, the presence of non-empty collections of outcomes (payoffs) similar to the core (say quasi-core) is fully guaranteed. Quasi-core is defined as a collection of coalitions minimal by inclusion among non-dominant coalitions induced through payoffs similar to super-modular characteristic functions (Shapley, 1971). As claimed, the quasi-core is identified via a version of P-NP problem that utilizes the branch and bound heuristic and the results are visualized by Excel spreadsheet.
Keywords: stability; game theory; coalition formation. 
@article{CGTM_2014_7_a19,
     author = {Joseph E. Mullat},
     title = {How to arrange a singles{\textquoteright} party: coalition formation in matching game},
     journal = {Contributions to game theory and management},
     pages = {221--238},
     publisher = {mathdoc},
     volume = {7},
     year = {2014},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2014_7_a19/}
}
TY  - JOUR
AU  - Joseph E. Mullat
TI  - How to arrange a singles’ party: coalition formation in matching game
JO  - Contributions to game theory and management
PY  - 2014
SP  - 221
EP  - 238
VL  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2014_7_a19/
LA  - en
ID  - CGTM_2014_7_a19
ER  - 
%0 Journal Article
%A Joseph E. Mullat
%T How to arrange a singles’ party: coalition formation in matching game
%J Contributions to game theory and management
%D 2014
%P 221-238
%V 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2014_7_a19/
%G en
%F CGTM_2014_7_a19
Joseph E. Mullat. How to arrange a singles’ party: coalition formation in matching game. Contributions to game theory and management, Tome 7 (2014), pp. 221-238. http://geodesic.mathdoc.fr/item/CGTM_2014_7_a19/