1 Search Results for "Philippe, Amaury"


Document
Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network

Authors: Bianca Marin Moreno, Christine Fricker, Hanene Mohamed, Amaury Philippe, and Martin Trépanier

Published in: LIPIcs, Volume 225, 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)


Abstract
The paper deals with a load-balancing algorithm for a closed stochastic network with two zones with different demands. The algorithm is motivated by an incentive algorithm for redistribution of cars in a large-scale car-sharing system. The service area is divided into two zones. When cars stay too long in the low-demand zone, users are encouraged to pick them up and return them in the high-demand zone. The zones are divided in cells called stations. The cars are the network customers. The mean-field limit solution of an ODE gives the large scale distribution of the station state in both clusters for this incentive policy in a discrete Markovian framework. An equilibrium point of this ODE is characterized via the invariant measure of a random walk in the quarter-plane. The proportion of empty and saturated stations measures how the system is balanced. Numerical experiments illustrate the impact of the incentive policy. Our study shows that the incentive policy helps when the high-demand zone observes a lack of cars but a saturation must be prevented especially when the high-demand zone is small.

Cite as

Bianca Marin Moreno, Christine Fricker, Hanene Mohamed, Amaury Philippe, and Martin Trépanier. Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network. In 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 225, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{moreno_et_al:LIPIcs.AofA.2022.13,
  author =	{Moreno, Bianca Marin and Fricker, Christine and Mohamed, Hanene and Philippe, Amaury and Tr\'{e}panier, Martin},
  title =	{{Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network}},
  booktitle =	{33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
  pages =	{13:1--13:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-230-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{225},
  editor =	{Ward, Mark Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.13},
  URN =		{urn:nbn:de:0030-drops-160998},
  doi =		{10.4230/LIPIcs.AofA.2022.13},
  annote =	{Keywords: Large scale analysis, mean-field, car-sharing, incentive algorithm, stochastic network, cluster, load balancing, closed Jackson networks, product-form distribution}
}
  • Refine by Author
  • 1 Fricker, Christine
  • 1 Mohamed, Hanene
  • 1 Moreno, Bianca Marin
  • 1 Philippe, Amaury
  • 1 Trépanier, Martin

  • Refine by Classification
  • 1 Mathematics of computing → Markov processes
  • 1 Mathematics of computing → Queueing theory
  • 1 Mathematics of computing → Stochastic processes

  • Refine by Keyword
  • 1 Large scale analysis
  • 1 car-sharing
  • 1 closed Jackson networks
  • 1 cluster
  • 1 incentive algorithm
  • Show More...

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail