Strategyproof approximation of the minimax on networks
From MaRDI portal
Recommendations
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs
- Strategyproof facility location for three agents on a circle
- Strategy-proof mechanisms for facility location games with many facilities
- Strategyproof facility location for concave cost functions
Cited in
(46)- Scheduling without payments
- Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain
- Algorithms for strategyproof classification
- Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents
- Two-facility location games with a minimum distance requirement on a circle
- Strategyproof facility location in perturbation stable instances
- Strategyproof mechanisms for \(2\)-facility location games with minimax envy
- Facility location games with optional preference
- Strategyproof facility location for three agents on a circle
- The anarchy of scheduling without money
- Strategy-proof mechanisms for obnoxious facility game with bounded service range
- Facility location games with distinct desires
- Mechanism design for one-facility location game with obnoxious effects on a line
- Parameterization of strategy-proof mechanisms in the obnoxious facility game
- Heterogeneous facility location without money
- Mechanism design with strategic mediators
- Strategy-proof mechanism for obnoxious facility location on a line
- Strategyproof facility location for concave cost functions
- Mechanism design for one-facility location game with obnoxious effects
- Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs
- Truthful generalized assignments via stable matching
- Strategy-proof location functions on finite graphs
- Multiple facility location games with envy ratio
- Multiple facility location games with envy ratio
- The obnoxious facility location game with dichotomous preferences
- Heterogeneous facility location with limited resources
- Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions
- Truthful two-facility location with candidate locations
- Truthful two-facility location with candidate locations
- Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio
- Proportionally fair clustering revisited
- Constant-approximate and constant-strategyproof two-facility location
- Strategy-proof mechanisms for maximizing social satisfaction in the facility location game
- Facility assignment with fair cost sharing: equilibrium and mechanism design
- Design and characterization of strategy-proof mechanisms for two-facility game on a line
- Facility location game for maximizing the social satisfaction on a line
- Parameterized voter relevance in facility location games with tree-shaped invitation graphs
- The k-facility location problem via optimal transport: a Bayesian study of the percentile mechanisms
- Walking in circles
- Approximation strategy-proof mechanisms for obnoxious facility location on a line
- Strategic facility location via predictions
- An impossibility result for strongly group-strategyproof multi-winner approval-based voting
- Constrained distributed heterogeneous two-facility location problems with max-variant cost
- On the strategyproof allocation of items under a budget constraint
- Constrained distributed heterogeneous two-facility location problems with max-variant cost
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
This page was built for publication: Strategyproof approximation of the minimax on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169105)
