License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2008.1581
URN: urn:nbn:de:0030-drops-15813
Go to the corresponding OASIcs Volume Portal

Kontogiannis, Spyros ; Zaroliagis, Christos

Robust Line Planning under Unknown Incentives and Elasticity of Frequencies

08002.Kontogiannis.1581.pdf (0.2 MB)


The problem of robust line planning requests for a set of
origin-destination paths (lines) along with their traffic rates (frequencies)
in an underlying railway network infrastructure, which are robust to
fluctuations of real-time parameters of the solution.
In this work, we investigate a variant of robust line planning stemming
from recent regulations in the railway sector that introduce competition
and free railway markets, and set up a new application scenario: there is
a (potentially large) number of line operators that have their lines fixed
and operate as competing entities struggling to exploit the underlying
network infrastructure via frequency requests, while the management of
the infrastructure itself remains the responsibility of a single (typically
governmental) entity, the network operator.
The line operators are typically unwilling to reveal their true incentives.
Nevertheless, the network operator would like to ensure a fair (or, socially
optimal) usage of the infrastructure, e.g., by maximizing the (unknown to
him) aggregate incentives of the line operators. We show that this can be
accomplished in certain situations via a (possibly anonymous) incentive-
compatible pricing scheme for the usage of the shared resources, that is
robust against the unknown incentives and the changes in the demands
of the entities. This brings up a new notion of robustness, which we
call incentive-compatible robustness, that considers as robustness of the
system its tolerance to the entities' unknown incentives and elasticity
of demands, aiming at an eventual stabilization to an equilibrium point
that is as close as possible to the social optimum.

BibTeX - Entry

  author =	{Spyros Kontogiannis and Christos Zaroliagis},
  title =	{{Robust Line Planning under Unknown Incentives and Elasticity of Frequencies}},
  booktitle =	{8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) },
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-07-1},
  ISSN =	{2190-6807},
  year =	{2008},
  volume =	{9},
  editor =	{Matteo Fischetti and Peter Widmayer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-15813},
  doi =		{10.4230/OASIcs.ATMOS.2008.1581},
  annote =	{Keywords: }

Collection: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)
Issue Date: 2008
Date of publication: 24.09.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI