运用算法博弈论探讨了固定需求下由刻板用户和利他用户组成的混合路由博弈的调和率问题.首先,建立了刻画这类混合路由博弈的变分不等式模型;然后,运用解析推导的方法得到了该类路由博弈调和率的上界,并以现有文献中的结论为特例.
The upper bound of the coordination ratio for a mixed routing game associated with oblivious users and altruistic users with fixed demand was investigated by algorithmic game theory. Firstly, the variational inequality model was established to describe this mixed routing game. Then, the upper bound of coordination ratio was derived by analytic derivation. The results took the results in existence literatures as its special case.