Matematicheskaya Teoriya Igr i Ee Prilozheniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Teor. Igr Pril.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2018, Volume 10, Issue 1, Pages 65–82 (Mi mgta214)  
This article is cited in 1 scientific paper (total in 1 paper)

Atomic Routing Game with Capacity Constraints

Darya A. Paltsevaab, Andrey P. Parfyonovba

a Institute for Problems of Regional Economics RAS
b Saint-Petersburg State University, Faculty of Applied Mathematics and Control Processes
Full-text PDF (324 kB) Citations (1) English version article
References:
PDF
HTML
Abstract: A model of an atomic routing game is considered. A network in this model has capacity constraints. Players in this game choose routes from some sources to one sink. The cost of passing each arc is determined by an increasing and convex function that depends on the number of players. Algorithms for finding the Nash equilibrium and social optimum are developed. These algorithms have a polynomial time complexity. The model can be used for transport networks with limited traffic flows.
Keywords: network games, routing games, network flows, Nash equilibrium, algorithm for finding equilibrium.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00124_a
English version:
Automation and Remote Control, 2019, Volume 80, Issue 10, Pages 1901–1911
DOI: https://doi.org/10.1134/S0005117919100102
Document Type: Article
UDC: 519.833.2
MSC: 22.18
Language: Russian
Citation: Darya A. Paltseva, Andrey P. Parfyonov, “Atomic Routing Game with Capacity Constraints”, Mat. Teor. Igr Pril., 10:1 (2018), 65–82; Autom. Remote Control, 80:10 (2019), 1901–1911
Citation in format AMSBIB
\Bibitem{PalPar18}
\by Darya~A.~Paltseva, Andrey~P.~Parfyonov
\paper Atomic Routing Game with Capacity Constraints
\jour Mat. Teor. Igr Pril.
\yr 2018
\vol 10
\issue 1
\pages 65--82
\mathnet{http://mi.mathnet.ru/mgta214}
\transl
\jour Autom. Remote Control
\yr 2019
\vol 80
\issue 10
\pages 1901--1911
\crossref{https://doi.org/10.1134/S0005117919100102}
Linking options:
  • https://www.mathnet.ru/eng/mgta214
  • https://www.mathnet.ru/eng/mgta/v10/i1/p65
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математическая теория игр и её приложения
    Statistics & downloads:
    Abstract page:268
    Full-text PDF :153
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026