Pages that link to "Item:Q757264"
From MaRDI portal
The following pages link to On the core of network synthesis games (Q757264):
Displaying 29 items.
- A core-allocation for a network restricted linear production game (Q271964) (← links)
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
- A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
- Extended cooperative networks games (Q1028468) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- Minimum cost forest games (Q1365003) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Social enterprise tree network games (Q1622035) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- A non-cooperative game theory approach to cost sharing in networks (Q2067258) (← links)
- Efficient computation of the Shapley value for large-scale linear production games (Q2177801) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- A cooperative location game based on the 1-center location problem (Q2275823) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
- On some approximately balanced combinatorial cooperative games (Q3142154) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- Averaged dual solution for linear production games and its characterization (Q6161246) (← links)
