Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
From MaRDI portal
Publication:4181649
DOI10.1287/moor.3.3.189zbMath0397.90111OpenAlexW2115064460MaRDI QIDQ4181649
Publication date: 1978
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7722a17b2b2b8007d8e0edaeaac84ede7f7d4260
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Cooperative games (91A12) Applications of game theory (91A80) Mathematical programming (90C99)
Related Items (68)
The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games ⋮ A core-allocation for a network restricted linear production game ⋮ Social enterprise tree network games ⋮ Monotonic games are spanning network games ⋮ A note on Steiner tree games ⋮ Approximation and collusion in multicast cost sharing ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Characteristic function games with restricted agent interactions: core-stability and coalition structures ⋮ On the core of the minimum cost Steiner tree game in networks ⋮ Values for cooperative games over graphs and games with inadmissible coalitions ⋮ The nucleolus of trees with revenues ⋮ Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach ⋮ Communication and its cost in graph-restricted games ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ The kernel/nucleolus of a standard tree game ⋮ Proof of permutationally convexity of MCSF games ⋮ Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof ⋮ On the core of a traveling salesman cost allocation game ⋮ Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ On the Shapley value of liability games ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Applications of efficient mergeable heaps for optimization problems on trees ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ The minimum cost spanning forest game ⋮ Arboricity games: the core and the nucleolus ⋮ Averaged dual solution for linear production games and its characterization ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Naturally submodular digraphs and forbidden digraph configurations ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ On the complexity of core, kernel, and bargaining set ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ A NOTE ON THE COMPUTATION OF THE SHAPLEY VALUE FOR VON NEUMANN–MORGENSTERN MARKET GAMES ⋮ Finding nucleolus of flow game ⋮ A fair rule in minimum cost spanning tree problems ⋮ Computing an element in the lexicographic kernel of a game ⋮ On the core and nucleolus of directed acyclic graph games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties ⋮ A generalization of the Shapley-ichiishi result ⋮ On the core and nucleolus of minimum cost spanning tree games ⋮ On complexity of single-minded auction ⋮ Cost allocation in collaborative forest transportation ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ Unnamed Item ⋮ A cooperative location game based on the 1-center location problem ⋮ Sharing the cost of multicast transmissions ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Weighted nucleoli and dually essential coalitions ⋮ Additivity in minimum cost spanning tree problems ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ A COMPUTATIONAL APPROACH TO THE COINCIDENCE OF EGALITARIAN SOLUTIONS FOR COST-SHARING GAMES ⋮ Cost allocation in spanning network enterprises with stochastic connection costs. ⋮ On the core of network synthesis games ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The Complexity of the Nucleolus in Compact Games ⋮ Minimum cost spanning tree games ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Three-person spanning tree games ⋮ Universally balanced combinatorial optimization games ⋮ Sharing costs in highways: a game theoretic approach ⋮ Values for interior operator games ⋮ Condorcet winners for public goods ⋮ Computing Shapley values in the plane ⋮ On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations
This page was built for publication: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
