Pages that link to "Item:Q4181649"

The following pages link to Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree (Q4181649):

Displaying 38 items.

• Sharing costs in highways: a game theoretic approach (Q257250) (← links)
• A core-allocation for a network restricted linear production game (Q271964) (← links)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
• On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
• The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties (Q532713) (← links)
• A generalization of the Shapley-ichiishi result (Q532758) (← links)
• On the complexity of core, kernel, and bargaining set (Q650525) (← links)
• On the core of network synthesis games (Q757264) (← links)
• Values for interior operator games (Q816512) (← links)
• Condorcet winners for public goods (Q816518) (← links)
• The nucleolus of trees with revenues (Q857952) (← links)
• Characterization of monotonic rules in minimum cost spanning tree problems (Q891331) (← links)
• Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
• Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
• The minimum cost spanning forest game (Q899945) (← links)
• Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• Cost allocation in collaborative forest transportation (Q976473) (← links)
• Additivity in minimum cost spanning tree problems (Q999732) (← links)
• Communication and its cost in graph-restricted games (Q1107455) (← links)
• On the core of a traveling salesman cost allocation game (Q1122517) (← links)
• Applications of efficient mergeable heaps for optimization problems on trees (Q1138378) (← links)
• Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
• On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
• Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof (Q1372734) (← links)
• Three-person spanning tree games (Q1596863) (← links)
• Social enterprise tree network games (Q1622035) (← links)
• Values for cooperative games over graphs and games with inadmissible coalitions (Q1651251) (← links)
• On complexity of single-minded auction (Q1765304) (← links)
• The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
• Cost allocation in spanning network enterprises with stochastic connection costs. (Q1811556) (← links)
• Approximation and collusion in multicast cost sharing (Q1885423) (← links)
• On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
• Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach (Q1905053) (← links)
• The kernel/nucleolus of a standard tree game (Q1914097) (← links)
• Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
• (Q5088947) (← links)
• Averaged dual solution for linear production games and its characterization (Q6161246) (← links)