Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Computing the nucleolus of some combinatorially-structured games
Autore:
Kuipers, J; Solymosi, T; Aarts, H;
Indirizzi:
Univ Pais Vasco, Inst Econ Publ, E-48080 Bilbao, Spain Univ Pais Vasco Bilbao Spain E-48080 st Econ Publ, E-48080 Bilbao, Spain Budapest Univ Econ Sci, Dept Operat Res, Budapest, Hungary Budapest Univ Econ Sci Budapest Hungary t Operat Res, Budapest, Hungary Univ Twente, Fac Appl Math, Enschede, Netherlands Univ Twente Enschede Netherlands , Fac Appl Math, Enschede, Netherlands
Titolo Testata:
MATHEMATICAL PROGRAMMING
fascicolo: 3, volume: 88, anno: 2000,
pagine: 541 - 563
SICI:
0025-5610(200009)88:3<541:CTNOSC>2.0.ZU;2-H
Fonte:
ISI
Lingua:
ENG
Soggetto:
SPANNING TREE;
Keywords:
TU; games; (pre)nucleolus; computational complexity;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Physical, Chemical & Earth Sciences
Citazioni:
20
Recensione:
Indirizzi per estratti:
Indirizzo: Kuipers, J Univ Pais Vasco, Inst Econ Publ, E-48080 Bilbao, Spain Univ Pais Vasco Bilbao Spain E-48080 l, E-48080 Bilbao, Spain
Citazione:
J. Kuipers et al., "Computing the nucleolus of some combinatorially-structured games", MATH PROGR, 88(3), 2000, pp. 541-563

Abstract

In this paper we introduce the B-prenucleolus for a transferable utility game (N, v), where B subset of or equal to 2(N). The B-prenucleolus is a straightforward generalization of the ordinary prenucleolus, where only the coalitions in B determine the outcome. We impose a combinatorial structure onthe collection B which enables us to compute the B-prenucleolus in O(n(3)/B/) time. The algorithm can be used for computing the nucleolus of several classes of games, among which is the case of minimum cost spanning tree games.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 30/11/20 alle ore 07:22:34