Pages that link to "Item:Q5713427"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713427):
Displaying 13 items.
- Efficient cost-sharing mechanisms for prize-collecting problems (Q494320) (← links)
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Group strategyproof cost sharing: the role of indifferences (Q2437817) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- A group-strategyproof mechanism for Steiner forests (Q2921719) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313017) (← links)
- The Price of Nash Equilibria in Multicast Transmissions Games (Q5387773) (← links)
- Structural Information and Communication Complexity (Q5710086) (← links)