2020
DOI: 10.1360/ssm-2020-0060
|View full text |Cite
|
Sign up to set email alerts
|

Minimum-cost spanning tree games: Bird rule revisited

Abstract: (cooperative games on combinatorial structures) [1, 2]. 又由于这些组合 优化问题通常在运筹学领域被研究, 因此这类博弈也称作运筹学博弈 (operations research games 或 operations management games) [3]. 若相应的组合优化问题跟网络相关, 则此类博弈也称作网络合作博

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…This problem is called fixed tree cost-allocation problem and it has also been studied in Granot et al (1996), and Koster et al (2002) in the context of game theory. Bird's rule (Bird 1976;Ertan et al 2020) is based on a particular solution for each fixed minimum cost spanning tree of the network and then, it can also be used also for this problem. Several interesting families of rules that contain Bird's rule have been defined.…”
Section: Introductionmentioning
confidence: 99%
“…This problem is called fixed tree cost-allocation problem and it has also been studied in Granot et al (1996), and Koster et al (2002) in the context of game theory. Bird's rule (Bird 1976;Ertan et al 2020) is based on a particular solution for each fixed minimum cost spanning tree of the network and then, it can also be used also for this problem. Several interesting families of rules that contain Bird's rule have been defined.…”
Section: Introductionmentioning
confidence: 99%