Competitive location under proportional choice

Kress, Dominik; Pesch, Erwin

doi:10.7494/dmms.2012.6.2.53

Competitive location under proportional choice

1-suboptimal points on networks

Publication date

2012

Document type

Forschungsartikel

Author

Kress, Dominik

Pesch, Erwin

Organisational unit

Universität Siegen

DOI

10.7494/dmms.2012.6.2.53

URI

https://openhsu.ub.hsu-hh.de/handle/10.24405/22248

Publisher

Akademia Górniczo-Hutnicza

Series or journal

Decision making in manufacturing and services

ISSN

2300-7087

Periodical volume

6

Periodical issue

2

First page

53

Last page

64

Peer-reviewed

✅

Part of the university bibliography

Nein

Language

English

Keyword

competitive location

voting location

vertex optimality

discretization

centroid problem

Abstract

This paper is concerned with a competitive or voting location problem on networks under a proportional choice rule that has previously been introduced by Bauer et al. (1993). We refine a discretization result of the authors by proving convexity and concavity properties of related expected payoff functions. Furthermore, we answer the long time open question whether 1-suboptimal points are always vertices by providing a counterexample on a tree network.

Version

Published version

Access right on openHSU

Metadata only access