The following pages link to (Q2934710):
Displaying 11 items.
- Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← 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)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Cost sharing in two-sided markets (Q2670930) (← links)
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems (Q5459996) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- (Q5743446) (← links)
