Differentiable Bilevel Programming for Stackelberg Congestion Games

计算机科学 数学优化 双层优化 路径(计算) 斯塔克伯格竞赛 水准点(测量) 纳什均衡 可微函数 相关平衡 启发式 数理经济学 博弈论 最优化问题 算法 均衡选择 重复博弈 数学 人工智能 数学分析 程序设计语言 大地测量学 地理
作者
Jiayang Li,Jing Yu,Qianni Wang,Boyi Liu,Zhaoran Wang,Yu Marco Nie
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
被引量:24
标识
DOI:10.1287/trsc.2026.0233
摘要

In a Stackelberg congestion game (SCG), a leader aims to maximize their own gain by anticipating and manipulating the equilibrium state at which the followers settle by playing a congestion game. Often formulated as bilevel programs, large-scale SCGs are well known for their intractability and complexity. Here, we attempt to tackle this computational challenge by marrying traditional methodologies with the latest differentiable programming techniques in machine learning. The core idea centers on replacing the lower-level equilibrium problem with a smooth evolution trajectory defined by the imitative logit dynamic (ILD), which we prove converges to the equilibrium of the congestion game under mild conditions. Building upon this theoretical foundation, we propose two new local search algorithms for SCGs. The first is a gradient descent algorithm that obtains the derivatives by unrolling ILD via differentiable programming. Thanks to the smoothness of ILD, the algorithm promises both efficiency and scalability. The second algorithm adds a heuristic twist by cutting short the followers’ evolution trajectory. Behaviorally, this means that instead of anticipating the followers’ best response at equilibrium, the leader seeks to approximate that response by only looking ahead a limited number of steps. Our numerical experiments are carried out over various instances of classic SCG applications ranging from toy benchmarks to large-scale real-world examples. The results show that the proposed algorithms are reliable and scalable local solvers that deliver high-quality solutions with greater regularity and significantly less computational effort compared with the many incumbents included in our study. Funding: This research is funded by the National Natural Science Foundation of China’s Young Scientists Fund (Type C) [Grant 72501242], the U.S. National Science Foundation’s Civil Infrastructure System Program [Grant CMMI 2225087], and the Energy, Power, Control, and Networks Program [Grant ECCS 2048075]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2026.0233 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
烹全鱼宴发布了新的文献求助10
刚刚
尊敬鸿完成签到,获得积分10
2秒前
康轩铭完成签到 ,获得积分10
2秒前
长青完成签到 ,获得积分10
3秒前
Yoopakho完成签到,获得积分10
3秒前
3秒前
Aoooo完成签到,获得积分10
3秒前
FashionBoy的应助被Sean采纳,获得10
4秒前
Dzinver完成签到,获得积分10
4秒前
4秒前
优雅的夏旋完成签到,获得积分10
4秒前
李健的应助被村口烫头祁师傅采纳,获得10
4秒前
任驰骋完成签到,获得积分10
5秒前
xiedi的应助被liu采纳,获得10
5秒前
5秒前
虚幻的靖儿完成签到 ,获得积分10
5秒前
suxinfeng完成签到,获得积分10
7秒前
搜集达人的应助被占博涛采纳,获得10
8秒前
哈47发布了新的文献求助10
8秒前
欢喜的楷瑞完成签到,获得积分10
8秒前
jackie完成签到,获得积分10
9秒前
无极微光的应助被叶95采纳,获得20
9秒前
CarryLJR的应助被Aoooo采纳,获得10
9秒前
shuyiWang发布了新的文献求助10
9秒前
百事可爱完成签到 ,获得积分10
10秒前
长青关注了科研通微信公众号
10秒前
今后的应助被xiaolong采纳,获得10
11秒前
奋斗的西装完成签到,获得积分10
12秒前
13秒前
清辉影的应助被XPR采纳,获得10
13秒前
小浅浅发布了新的文献求助10
13秒前
14秒前
科目三的应助被yuyuhong采纳,获得10
14秒前
麻瓜完成签到,获得积分10
14秒前
叫我老贾就好了完成签到,获得积分10
15秒前
丘比特的应助被科研通管家采纳,获得10
15秒前
田様的应助被科研通管家采纳,获得10
16秒前
英姑的应助被科研通管家采纳,获得10
16秒前
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Boundaries and Bodhisattvas 500
高分子基功能界面水蒸发材料与应用研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8181823
求助须知:如何正确求助?哪些是违规求助? 9571511
关于积分的说明 21818391
捐赠科研通 7778076
什么是DOI,文献DOI怎么找? 3433524
关于科研通互助平台的介绍 2557696
邀请新用户注册赠送积分活动 2479614