Location of competitive facilities: a comprehensive review and future research agenda

M Mishra, SP Singh, MP Gupta - Benchmarking: An International …, 2023 - emerald.com
Purpose The research in competitive facility location (CFL) is quite dynamic, both from a
problem formulation and an algorithmic point of view. Research direction has changed …

Primarily about primaries

A Borodin, O Lev, N Shah, T Strangway - Proceedings of the AAAI …, 2019 - ojs.aaai.org
Much of the social choice literature examines direct voting systems, in which voters submit
their ranked preferences over candidates and a voting rule picks a winner. Real-world …

A Hotelling-Downs framework for party nominees

P Harrenstein, G Lisowski, R Sridharan, P Turrini - 2021 - ora.ox.ac.uk
We present a model for the strategic selection of party nominees, where competing groups
choose their representatives based on the expected electoral returns. Technically, we look …

ε-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

V Beresnev, A Melnikov - EURO Journal on Computational Optimization, 2020 - Elsevier
We consider a model of two parties' competition organized as a Stackelberg game. The
parties open their facilities intending to maximize profit from serving the customers that …

On re-balancing self-interested agents in ride-sourcing transportation networks

A Sadeghi, SL Smith - 2019 IEEE 58th Conference on Decision …, 2019 - ieeexplore.ieee.org
This paper focuses on the problem of controlling self-interested drivers in ride-sourcing
applications. Each driver has the objective of maximizing its profit, while the ride-sourcing …

Rebalancing self-interested drivers in ride-sharing networks to improve customer wait-time

AS Yengejeh, SL Smith - IEEE Transactions on Control of …, 2021 - ieeexplore.ieee.org
In this article, we address the problem of controlling self-interested drivers in ride-sharing
applications. The objective of the ride-sharing company is to improve the customer …

Two influence maximization games on graphs made temporal

N Boehmer, V Froese, J Henkel, Y Lasars… - arXiv preprint arXiv …, 2021 - arxiv.org
To address the dynamic nature of real-world networks, we generalize competitive diffusion
games and Voronoi games from static to temporal graphs, where edges may appear or …

Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game

T Byrne, SP Fekete, J Kalcsics, L Kleist - Annals of Operations Research, 2023 - Springer
We study competitive location problems in a continuous setting, in which facilities have to be
placed in a rectangular domain R of normalized dimensions of 1 and ρ≥ 1, and distances …

[PDF][PDF] A Hotelling-Downs Game for Strategic Candidacy with Binary Issues

J Maass, V Mousseau, A Wilczynski - Proceedings of the 2023 …, 2023 - ifaamas.org
Strategic voting [20] is a major topic of interest and has been widely studied in
Computational Social Choice [4] and Algorithmic Game Theory [22]. While strategic behavior …

[HTML][HTML] The discrete Voronoi game in R2

A Banik, BB Bhattacharya, S Das, S Mukherjee - Computational Geometry, 2017 - Elsevier
In this paper we study the last round of the discrete Voronoi game in R 2, a problem which is
also of independent interest in competitive facility location. The game consists of two players …