Cookie Setting MathNet Korea

이전페이지 이동
On the Price of Satisficing in Network User Equilibria
[2017 Discrete Math 세미나]
Date: 2017-07-10
Speaker : 권창현 (University of South Florida)
Abstract : When network users are satisficing decision-makers, the resulting traffic pattern attains a satisficing user equilibrium, which may deviate from the (perfectly rational) user equilibrium. In a satisficing user equilibrium traffic pattern, the total system travel time can be worse than in the case of the PRUE. We show how bad the worst-case satisficing user equilibrium traffic pattern can be, compared to the perfectly rational user equilibrium. We call the ratio between the total system travel times of the two traffic patterns the price of satisficing, for which we provide an analytical bound. Using the sensitivity analysis for variational inequalities, we propose a numerical method to quantify the price of satisficing for any given network instance.
VOD : [Android_VOD]    [iPhone_VOD]    [Windows_VOD]
Information Center for Mathematical Sciences KAIST
305-701 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8195~6 / 팩스 042-350-5722
e-mail :
Copyright (C) 2017. ICMS All Rights Reserved.