Title

The 1-dimensional discrete Voronoi game

Article Type

Research Article

Publication Title

Operations Research Letters

Abstract

The discrete Voronoi game in R consists of two competing players P1 and P2 and a set of N users placed on a line-segment. The players alternately place one facility each on the line-segment for R-rounds, where the objective is to maximize their own total payoffs. We prove bounds on the worst-case (over the arrangement of the N users) payoffs of the two players, and discuss algorithms for finding the optimal strategies of the players in the 2-round game.

First Page

115

Last Page

121

DOI

10.1016/j.orl.2019.01.003

Publication Date

3-1-2019

This document is currently not available here.

Share

COinS