Strategyproof Approximation of the Minimax on Networks
From MaRDI portal
Publication:3169105
DOI10.1287/moor.1100.0457zbMath1232.91015OpenAlexW2155975756MaRDI QIDQ3169105
Moshe Tennenholtz, Michal Feldman, Ariel D. Procaccia, Noga Alon
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1100.0457
Noncooperative games (91A10) Games involving graphs (91A43) Discrete location and assignment (90B80)
Related Items (28)
Heterogeneous facility location without money ⋮ Mechanism design for one-facility location game with obnoxious effects on a line ⋮ Two-facility location games with a minimum distance requirement on a circle ⋮ Strategyproof facility location in perturbation stable instances ⋮ Strategyproof facility location for concave cost functions ⋮ Strategyproof mechanisms for \(2\)-facility location games with minimax envy ⋮ Strategy-Proof Mechanism for Obnoxious Facility Location on a Line ⋮ Scheduling without payments ⋮ The obnoxious facility location game with dichotomous preferences ⋮ The anarchy of scheduling without money ⋮ Strategy-proof mechanisms for obnoxious facility game with bounded service range ⋮ Facility location games with distinct desires ⋮ Heterogeneous facility location with limited resources ⋮ Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions ⋮ Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules ⋮ Facility location games with optional preference ⋮ Mechanism Design for One-Facility Location Game with Obnoxious Effects ⋮ 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 ⋮ Walking in circles ⋮ Approximation strategy-proof mechanisms for obnoxious facility location on a line ⋮ Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game ⋮ Multiple facility location games with envy ratio ⋮ Multiple facility location games with envy ratio ⋮ Truthful Generalized Assignments via Stable Matching ⋮ Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs ⋮ Strategy-Proof Location Functions on Finite Graphs
This page was built for publication: Strategyproof Approximation of the Minimax on Networks
