Pages that link to "Item:Q2921719"
From MaRDI portal
The following pages link to A group-strategyproof mechanism for Steiner forests (Q2921719):
Displaying 16 items.
- Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game (Q3532565) (← links)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems (Q5459996) (← links)
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location (Q5459999) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- Structural Information and Communication Complexity (Q5710086) (← links)
- Automata, Languages and Programming (Q5716840) (← links)