Publications
Publications
- Operations Research Letters
Orienteering for Electioneering
By: Jonah Kallenbach, Robert Kleinberg and Scott Duke Kominers
Abstract
In this paper, we introduce a combinatorial optimization problem that models the investment decision a political candidate faces when treating his or her opponents’ campaign plans as given. Our formulation accounts for both the time cost of traveling between districts and the time expended while campaigning within districts. We describe a polynomial-time algorithm that computes a (2 + ∈)-approximation to the optimal solution of a discrete version of our problem by reducing the problem to another combinatorial optimization problem known as Orienteering.
Keywords
Citation
Kallenbach, Jonah, Robert Kleinberg, and Scott Duke Kominers. "Orienteering for Electioneering." Operations Research Letters 46, no. 2 (March 2018): 205–210.