不同类型车辆在拥堵博弈中的潜力

IF 0.5 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2025-03-28 DOI:10.1134/S1064562424602580

N. N. Nikitina, V. V. Mazalov

{"title":"不同类型车辆在拥堵博弈中的潜力","authors":"N. N. Nikitina, V. V. Mazalov","doi":"10.1134/S1064562424602580","DOIUrl":null,"url":null,"abstract":"Heterogeneous congestion games make it possible to simulate traffic situations involving multiple classes of vehicles with different preferences in choosing routes. In this work, we prove the existence of a potential in a discrete congestion game with n classes of players. Examples are given in which we calculate equilibria and demonstrate the emergence of the Braess paradox, as well as use the constructed congestion game to analyze the distribution of vehicles in the graph of urban roads for the city of Petrozavodsk.","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 2 supplement","pages":"S433 - S439"},"PeriodicalIF":0.5000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Potential in Congestion Game with Different Types of Vehicles\",\"authors\":\"N. N. Nikitina, V. V. Mazalov\",\"doi\":\"10.1134/S1064562424602580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Heterogeneous congestion games make it possible to simulate traffic situations involving multiple classes of vehicles with different preferences in choosing routes. In this work, we prove the existence of a potential in a discrete congestion game with n classes of players. Examples are given in which we calculate equilibria and demonstrate the emergence of the Braess paradox, as well as use the constructed congestion game to analyze the distribution of vehicles in the graph of urban roads for the city of Petrozavodsk.\",\"PeriodicalId\":531,\"journal\":{\"name\":\"Doklady Mathematics\",\"volume\":\"110 2 supplement\",\"pages\":\"S433 - S439\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Doklady Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1064562424602580\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562424602580","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

异构拥堵博弈可以模拟多类车辆在选择路线时的不同偏好。在这项工作中，我们证明了具有n类玩家的离散拥塞对策的势的存在性。文中给出了计算均衡的例子，并证明了Braess悖论的出现，以及使用构建的拥堵博弈来分析彼得罗扎沃茨克城市道路图中的车辆分布。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Potential in Congestion Game with Different Types of Vehicles

查看原文本刊更多论文

Potential in Congestion Game with Different Types of Vehicles

Heterogeneous congestion games make it possible to simulate traffic situations involving multiple classes of vehicles with different preferences in choosing routes. In this work, we prove the existence of a potential in a discrete congestion game with n classes of players. Examples are given in which we calculate equilibria and demonstrate the emergence of the Braess paradox, as well as use the constructed congestion game to analyze the distribution of vehicles in the graph of urban roads for the city of Petrozavodsk.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.