Show Less

Sequential Competitive Location on Networks

Series:

Dominik Kreß

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.

Prices

Show Summary Details
Restricted access

Preface

Extract

This dissertation would not have been possible without the support of nu- merous people, to all of whom I am deeply grateful. First of all, I wish to express my gratitude to my advisor Prof. Dr. Erwin Pesch. His encouragement, guidance, support, as well as his constructive and detailed feedback have been the most valuable assets during the last years. I would also like to thank Prof. Dr. Dirk Briskorn for serving as the second referee of my thesis and Prof. Dr. Dr. h.c. Wolfgang Domschke for awakening my interest in the field of Operations Research and paving my way to the research community. I am very grateful to my colleagues and friends Dr. Sergei Chubanov, Roswitha Eifler, Prof. Dr. Florian Jaehn, Sebastian Meiswinkel, Dr. Jenny Nossack, Dr. Alena Otto, Daniel Schnitzler and Philipp Zeise at the Uni- versity of Siegen, as well as Dr. Christian Lang, Dr. Daniel Scholz and Dr. Florian Seeanner and at the TU Darmstadt. You have been a fruitful source of encouragement and inspiration. Thank you for your valuable ideas and feedback. I am thankful to my family, especially my parents, grandparents and the Helland and Huckins family for their support at all times and for bringing me up to think for myself. Also, I am deeply grateful to my friends Alex, Caspar, Johannes, Max and Timo for always being there. Thank you, Anika, for all your love and support as well as your patience (not only) during this project. Last but not least, I...

You are not authenticated to view the full text of this chapter or article.

This site requires a subscription or purchase to access the full text of books or journals.

Do you have any questions? Contact us.

Or login to access all content.