Treffer: Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
Title:
Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
Source:
Mathematics of operations research. 17(4):765-780
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1992.
Publication Year:
1992
Physical Description:
print, 29 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Théorie des jeux, Game theory, Arbre maximal, Spanning tree, Arbol máximo, Complexité calcul, Computing complexity, Complejidad cálculo, Coût fixe, Fixed cost, Costo fijo, Forêt graphe, Forest(graph), Bosque grafo, Jeu coopératif, Cooperative game, Juego cooperativo, Noyau jeu, Game core, Núcleo juego, Optimisation, Optimization, Optimización, Programmation linéaire, Linear programming, Programación lineal, Théorie graphe, Graph theory, Teoría grafo, Théorie jeu, Game theory, Teoría juego, Cost allocation
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. British Columbia, fac. comerce business administration, Vancouver BC V6T 1Z2, Canada
ISSN:
0364-765X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4442865
Database:
PASCAL Archive
Weitere Informationen
We present a computational analysis of a game theoretic approach to a cost allocation problem arising from a graph optimization problem, referred to as the fixed cost spanning forest (FCSF) problem. The customers in the FCSF problem, represented by nodes in a graph G, are in need of service that can be produced at some facilities yet to be constructed. The cost allocation problem is concerned with the fair distribution of the cost of providing the service among customers. We formulate this cost allocation problem as a cooperative game, referred to as the FCSF game. In general, the core of a FCSF game may be empty.