Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Thomas Byrne, Sándor P Fekete, Jörg Kalcsics, Linda Kleist

Ngôn ngữ: eng

Ký hiệu phân loại: 519.3 Game theory

Thông tin xuất bản: 2020

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 165675

 Comment: 22 pages, 16 figuresWe 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 $\rho\geq 1$, and distances are measured according to the Manhattan metric. We show that the family of 'balanced' facility configurations (in which the Voronoi cells of individual facilities are equalized with respect to a number of geometric properties) is considerably richer in this metric than for Euclidean distances. Our main result considers the 'One-Round Voronoi Game' with Manhattan distances, in which first player White and then player Black each place $n$ points in $R$
  each player scores the area for which one of its facilities is closer than the facilities of the opponent. We give a tight characterization: White has a winning strategy if and only if $\rho\geq n$
  for all other cases, we present a winning strategy for Black.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH