Pages that link to "Item:Q2471805"
From MaRDI portal
The following pages link to Cost-sharing mechanisms for network design (Q2471805):
Displaying 16 items.
- Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Strategic sharing of a costly network (Q504401) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Cost allocation protocols for supply contract design in network situations (Q1014299) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- From packing rules to cost-sharing mechanisms (Q2082177) (← links)
- The warehouse-retailer network design game (Q2514656) (← links)
- Open problems in cooperative location games (Q2852565) (← links)
- On cost allocation in communication networks (Q3032107) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313017) (← links)
- On cost sharing mechanisms in the network design game (Q5401465) (← links)
- (Q5743446) (← links)