Pages that link to "Item:Q1617675"
From MaRDI portal
The following pages link to Mechanism design for two-opposite-facility location games with penalties on distance (Q1617675):
Displaying 11 items.
- Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670) (← links)
- A cost-sharing scheme for the \(k\)-level facility location game with penalties (Q2136517) (← links)
- Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358) (← links)
- Strategyproof mechanisms for \(2\)-facility location games with minimax envy (Q2156318) (← links)
- Facility location games with optional preference (Q2210526) (← links)
- Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game (Q2656357) (← links)
- Mechanism design for facility location with fractional preferences and minimum distance (Q2695319) (← links)
- Multiple facility location games with envy ratio (Q5918333) (← links)
- Multiple facility location games with envy ratio (Q5925504) (← links)
- Strategyproof facility location with limited locations (Q6047582) (← links)
- Two homogeneous facility location games with a minimum distance requirement on a circle (Q6122598) (← links)
