• No results found

Minimum Cost Spanning Tree Game (MCSTG)

Cost monotonicity, consistency and minimum cost spanning tree games

Cost monotonicity, consistency and minimum cost spanning tree games

... labelled minimum cost spanning tree ...or cost allocation ...a minimum cost spanning tree game is always ...

38

Cost monotonicity, consistency and minimum cost spanning tree games

Cost monotonicity, consistency and minimum cost spanning tree games

... labelled minimum cost spanning tree ...or cost allocation ...a minimum cost spanning tree game is always ...

36

Multi-criteria minimum cost spanning tree games

Multi-criteria minimum cost spanning tree games

... The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that 9 has been widely studied in the ...BirdÕs cost allocation rule ...

10

Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

... classical minimum cost spanning tree game a population monotonic allocation ...every minimum cost spanning tree game can be written as nonnegative ...

21

The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects

The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects

... a minimum cost spanning ...cooperative game to tackle this cost allocation ...the minimum cost spanning tree game (mcst game) when a ...

22

Cooperative games for minimum cost spanning tree problems

Cooperative games for minimum cost spanning tree problems

... Minimum cost spanning tree problems are well known problems in the Oper- ations Research literature. Some agents, located at different geographical places, want a service provided by a common ...

32

Cooperative games for minimum cost spanning tree problems

Cooperative games for minimum cost spanning tree problems

... Minimum cost spanning tree problems are well known problems in the Oper- ations Research literature. Some agents, located at different geographical places, want a service provided by a common ...

32

No advantageous merging in minimum cost spanning tree problems

No advantageous merging in minimum cost spanning tree problems

... (2006) proved that ϕ is the Shapley value of a different coalitional game. More recently, Tijs et al. (2004) defined a class of rules called Obligation Rules. Moretti et al. (2005) studied this class of rules. ...

27

Minimum Cost Spanning Tree Games and Spillover Stability

Minimum Cost Spanning Tree Games and Spillover Stability

... This paper deals with the most basic strategic consideration a player faces: whether or not to cooperate. In an mcst problem, a player might have an incentive not to cooperate, let other players connect themselves to the ...

15

On the Shapley value of a minimum cost spanning tree problem

On the Shapley value of a minimum cost spanning tree problem

... coalitional game with each minimum cost spanning tree ...the cost of connection assuming that the rest of the agents are already ...a cost sharing rule as the Shapley ...

17

A generalization of obligation rules for minimum cost spanning tree problems

A generalization of obligation rules for minimum cost spanning tree problems

... irreducible game v C ∗ (see Berganti˜ nos and Vidal-Puga, 2007b [7]) is a subset of the family of obligation ...the game v C ∗ is concave, the core of this game coincides with the convex hull of the ...

16

MoL 2013 09: 
  The Iterative Minimum Cost Spanning Tree Problem

MoL 2013 09: The Iterative Minimum Cost Spanning Tree Problem

... classical minimum cost spanning tree ...cooperative game theory and graph ...of minimum cost which connects all agents to the source, will be ...total cost of the ...

117

A monotonic and merge-proof rule in minimum cost spanning tree situations

A monotonic and merge-proof rule in minimum cost spanning tree situations

... the cost of connecting themselves to the ...the game associated to a mcst ...associated game (see Kar ...the cost allocated to any agent will not decrease if new agents join the ...

31

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

... the minimum cost spanning tree, another interesting issue that usually arises is how to allocate that cost to the ...in minimum cost spanning tree problems ...

33

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

... introduce minimum cost spanning tree problems with multiple ...irreducible game; second as an obligation rule; third as a partition rule; and finally through a cone-wise ...same ...

39

A monotonic and merge proof rule in minimum cost spanning tree situations

A monotonic and merge proof rule in minimum cost spanning tree situations

... the cost of connecting themselves to the ...the game associated to a mcst ...associated game (see Kar ...the cost allocated to any agent will not decrease if new agents join the ...

31

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

... the minimum cost spanning tree, another inter- esting issue that usually arises is how to allocate that cost to the ...in minimum cost spanning tree problems ...

35

A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems

A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems

... the cost of constructing e. Obviously, the minimum cost network that would connect all the agents to the source has to form a spanning tree of hV, E V ...a spanning tree ...

18

Contractors’ minimum spanning tree

Contractors’ minimum spanning tree

... the minimum spanning tree problem, where each edge in the graph belongs to some contractor, and each contractor has his/her own cost function for paving a subset of the ...cardinality ...

13

Minimum Diameter Spanning Tree

Minimum Diameter Spanning Tree

... a minimum dominating set if G has no dominating set of smaller ...of minimum dominating set of G is called the dominating number for G and it is denoted by γ ( ) G ...

6

Show all 10000 documents...

Related subjects