Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.
Xujin ChenXiaodong HuZhongzheng TangChenhao WangPublished in: Inf. Process. Lett. (2021)
Keyphrases
- lower bound
- facility location
- strategy proof
- lagrangian relaxation
- upper bound
- mechanism design
- branch and bound algorithm
- integer programming
- game theory
- np hard
- worst case
- network design
- lower and upper bounds
- branch and bound
- quasi linear
- combinatorial auctions
- mixed integer
- resource allocation
- optimal solution
- multi criteria
- nash equilibrium
- computational complexity
- objective function
- auction mechanisms
- genetic algorithm
- neural network
- fuzzy logic