Pages that link to "Item:Q5856478"
From MaRDI portal
The following pages link to Two-facility Location Games with Minimum Distance Requirement (Q5856478):
Displaying 19 items.
- Strategyproof mechanism design for facility location games with weighted agents on a line (Q489723) (← links)
- Strategyproof mechanisms for 2-facility location games with minimax envy (Q2039669) (← links)
- Facility reallocation on the line (Q2088586) (← links)
- Two-facility location games with a minimum distance requirement on a circle (Q2150574) (← 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)
- Constrained heterogeneous facility location games with max-variant cost (Q2698023) (← links)
- A Class of Location Games with Type Dependent Facilities (Q3133401) (← links)
- Discrete facility location games with different preferences (Q6053969) (← links)
- Minmax for facility location game with optional preference under minimum distance requirement (Q6065505) (← links)
- Heterogeneous facility location with limited resources (Q6102518) (← links)
- Two homogeneous facility location games with a minimum distance requirement on a circle (Q6122598) (← links)
- On Discrete Truthful Heterogeneous Two-Facility Location (Q6156615) (← links)
- The distortion of distributed facility location (Q6494355) (← links)
- Truthful two-facility location with candidate locations (Q6546305) (← links)
- On truthful constrained heterogeneous facility location with max-variant cost (Q6556154) (← links)
- Constrained heterogeneous two-facility location games with sum-variant (Q6571273) (← links)
- Truthful two-facility location with candidate locations (Q6652456) (← links)
