• Corpus ID: 246015942

Cost Sharing for Connectivity with Budget

  title={Cost Sharing for Connectivity with Budget},
  author={Tianyi Zhang and Dengji Zhao and Junyu Zhang and Sizhe Gu},
We consider a cost sharing problem to connect all nodes in a weighted undirected graph, where the weight of each edge represents the cost to use the edge for the connectivity and the cost has to be shared among all connected nodes. There is one node called the source to which all the other nodes want to connect and it does not share the costs of the connectivity. As a node may need to go through other nodes to reach the source, the intermediate nodes may behave strategically to block the… 
1 Citations

Figures from this paper

Mechanism Design Powered by Social Interactions: A Call to Arms

There is an important theoretical value to discover and the study will stimulate many interesting applications, especially under decentralized systems with blockchain, which will form larger games in auctions, coalitional games, matching etc., which is not achievable with the traditional solutions.



Minimum cost spanning tree games

It is shown that the core and the nucleolus of the original game are the cartesian products of the cores and theucleoli, respectively, of the induced games on the components of the efficient coalition structure.

On cost allocation for a spanning tree: A game theoretic approach

A refinement of the core of a cooperative game, called the irreducible core, is introduced and the extreme points of the solution can be characterized by permutations of the minimal cost spanning tree.

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

We present a new model for cost sharing in minimum cost spanning tree problems to allow planners to identify how many agents merge. Under this new framework, in contrast to the traditional model,

Incremental cost sharing: Characterization by coalition strategy-proofness

Abstract. Each one of n users consumes an idiosyncratic commodity produced in indivisible units. The n commodities are jointly produced by a central facility and total cost must be shared by the

Game theory and cost allocation problems

Problems of allocating joint costs in a reasonable way arise in many practical situations where people decide to work together to save costs. Cost allocation methods based on game theoretical

Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games

Abstract This paper axiomatizes the Shapley value on minimum cost spanning tree games by using axioms which are different from those used in network games. Journal of Economic Literature