
Sequential Competitive Location on Networks
Dominik Kreß(Author)
Peter Lang Verlag
Published on 10. April 2013
Book
Paperback/Softback
178 pages
978-3-631-62767-9 (ISBN)
Description
This book deals with classical competitive location problems where two players, leader and follower, sequentially enter markets with given numbers of facilities. The markets under consideration are represented as networks. The book provides a detailed overview of the literature on competitive and voting location, and it presents extensions and variations of the classical models, with a focus on the incorporation of proportional choice rules, non-discrete demand (edge demand), or additional pricing decisions of the players. It provides corresponding mathematical models, insights into the computational complexity of the resulting problems and proposes and analyzes adequate solution methods.
More details
Series
Thesis
Doctoral thesis
2013
Siegen, Univ.,
Edition
New edition
Language
English
Place of publication
Berlin
Germany
Edition type
New edition
Illustrations
23 tables, 37 graphs
Dimensions
Height: 21 cm
Width: 14.8 cm
Weight
260 gr
ISBN-13
978-3-631-62767-9 (9783631627679)
DOI
10.3726/978-3-653-02753-2
Schweitzer Classification
Other editions
Additional editions

Dominik Kreß
Sequential Competitive Location on Networks
Eine kleine Einführung in die Welt der afrikanischen Sprachen, ihre Rolle in Kultur und Gesellschaft und ihre Literaturen
E-Book
05/2013
150th Edition
Peter Lang Verlag
€90.99
Available for download
Person
Dominik Kreß studied Business Administration and Engineering at the University of Darmstadt, where he graduated in 2009 and worked as a research assistant at the Chair of Operations Research until 2010. He currently is a research assistant at the Department of Management Information Science at the University of Siegen, where he received his doctoral degree in 2013.
Content
Contents: Detailed literature review: Sequential competitive location on networks - Competitive or voting location under proportional choice: k-optimal and k-suboptimal points - (r,p)-centroid problems on networks with vertex and edge demand - Competitive location and pricing on networks with random utilities.