Minimum cost spanning tree games
Minimum cost spanning tree games and population monotonic allocation schemes
... mcst games In this final section we will consider some variants of minimum cost spanning tree ...monotonic minimum cost spanning tree games which are ...
21
The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects
... for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in ...stable cost monotonic allocation rule for mcst-problems is a selection of the ...
22
Obligation rules for minimum cost spanning tree situations and their monotonicity properties
... Key-words: minimum cost spanning tree games, cost monotonicity, popu- lation monotonic allocation ...total cost of connection is provided by a minimum cost ...
19
The P-value for cost sharing in minimum cost spanning tree situations
... Key-words: Cost sharing, minimum cost spanning tree games, value, po- pulation monotonic allocation schemes. 1 Introduction Since the basic paper of Bird (1976) much attention ...
16
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game
... Stackelberg Games, Spanning Trees, ...Stackelberg Minimum Spanning Tree Game (StackMST) is defined in terms of a undirected graph G = (V, E), with two sets of edges, blue B and red R (E ...
9
Three Selfish Spanning Tree Games
... the cost of a spanning ...(the tree) and how its cost is shared. Bird’s cost allocation [5] consists in computing a minimum cost spanning tree and each ...
18
Silent self-stabilizing scheme for spanning-tree-like constructions
... for Spanning-Tree-like Constructions ICDCN’19, January 2019, Bangalore, India at most 4 · n rounds and 5 · n 2 steps, while the algorithm given in [34] stabilizes in n · D ...
11
Asynchronous Games over Tree Architectures
... P\{`} . The reduction will work in exponential-time. If we represent CG as a tree of depth l then applying this construction iteratively we will get an l-fold exponential algorithm to solve the control problem for ...
13
Étude des performances du Distributed Spanning Tree : un Overlay Network pour la Recherche de Services
... Distributed Spanning Tree, qui permet l’implantation d’algorithmes de traversée d’arbres tout en évitant les goulets d’étranglement inhérents à ceux-ci et, de ce fait, offre une exécution plus efficace des ...
13
The Radial Spanning Tree of a Poisson Point Process
... This tree has a local construction rule and a radial structure with the origin as its root We first use stochastic geometry arguments to analyze local functionals of the random tree such[r] ...
77
Production Cost Asymmetry, Minimum Access and Reciprocal Dumping
... the minimum access ...marginal cost will have a smaller share of ...the minimum access commitment to different provinces/countries, but also production control to guarantee a sufficiently high ...
33
Minimum Convex-Cost Tension Problems on Series-Parallel Graphs
... As explained in [9] and [17], such documents are composed of media objects (audio, video, text, image...), which duration of presentation must be adjusted to satisfy a set of temporal con- straints that express the ...
15
Minimum-Cost Virtual Network Function Resilience
... RESILIENCE PROBLEM (VNFR) 2.1 Problem Definition The network is represented by a directed graph G(V , A), where V is the set of network nodes and A the set of arcs. Each network node u corresponds to a site in which a ...
7
Laplacian matrices and spanning trees of tree graphs
... This construction is recalled in Section 2, (the reader can already have a look at the example of Figure 1). In the recent paper [4], the first author conjectured that the number of spanning trees of T G is given ...
21
Minimum Reload Cost Graph Factors
... reload cost concept has various applications in transportation networks, communication networks, and energy distribution ...reload cost concept can be used to model this situation [ 9 ...switching ...
23
Brief announcement: Minimum spanning trees and cone-based topology control
... the minimum spanning tree is contained in the graph pro- duced by CBT C(α). Its interesting to note that by com- parison other topology control algorithms are variations of the Gabriel Graph [5], the ...
3
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
... problem, Minimum spanning tree problem, Submodular ...mal spanning tree problems involve a single cost function, additively decomposable over the arcs (or ...
29
Convexity of graph-restricted games induced by minimum partitions
... convex) games (N, v), the P-restricted games (N, v) are superadditive ...underlying games (N, v) restricted to the family of unanimity games, has also been proved in (Grabisch and Skoda, ...
37
Convexity of Network Restricted Games Induced by Minimum Partitions
... restricted games have been defined when there exists a hierarchical structure on the set of ...players. Games with permission structures have been introduced in [9] to describe situations where some players ...
33
Convexity of Graph-Restricted Games Induced by Minimum Partitions
... restricted games on weighted graphs associated with minimum ...a minimum partition. This minimum partition P min is induced by the deletion of the minimum weight ...
38