|
|||||
|
|
Orienteering for electioneering |
|
| Authors: | Jonah Kallenbach Robert Kleinberg Scott Duke Kominers |
| Institution: | 1. Department of Computer Science, Harvard University, United States;2. Department of Computer Science, Cornell University, United States;3. Harvard Business School, Harvard University, United States;4. Department of Economics, Harvard University, United States;5. Center of Mathematical Sciences and Applications, Harvard University, United States;6. Center for Research on Computation and Society, Harvard University, United States;g. National Bureau of Economic Research, United States |
| 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 -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: | Electioneering Political campaigning Combinatorial optimization Orienteering |
| 本文献已被 ScienceDirect 等数据库收录！ | |