Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-007 | 1st January 1995 00:00

THE NUCLEON OF COOPERATIVE GAMES AND AN ALGORITHM FOR MATCHING GAMES

RSS-Feed




TR95-007
Authors: U. Faigle, S.P. Fekete, W. Hochstättler, W. Kern
Publication: 1st January 1995 00:00
Downloads: 1115
Keywords: 


Abstract:

The {\it nucleon} is introduced as a new allocation concept for
non-negative cooperative n-person transferable utility games.
The nucleon may be viewed as the multiplicative analogue of
Schmeidler's nucleolus.
It is shown that the nucleon of (not necessarily bipartite) matching
games can be computed in polynomial time.



ISSN 1433-8092 | Imprint