• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Optimal Allocation Strategy Based on Stackelberg Game for Inspecting Drunk Driving on Traffic Network

Vol. 11, No.12, December 31, 2017
10.3837/tiis.2017.12.005, Download Paper (Free):

Abstract

As the main means to cope with the stubborn problem of drunk driving, the inspection of drunk driving has already been paid more attention and thus reinforced. In this paper, we model this scenario as a Stackelberg game, where the police department (called defender) allocates resources dynamically in terms of the traffic situation on the traffic network to arrest drink drivers and drivers who drink (called attacker), whether choosing drunk driving or designated driving service, expect to minimize their cost for given travel routes. However, with the number of resources are limited, our goal is to calculate the optimal resource allocation strategy for the defender. Therefore, first, we provide an effective approach (named OISDD) to fulfill our goal, i.e., generate the optimal strategy to inspect drunk driving. Second, we apply OISDD to directed graphs (which are abstracted from Dalian traffic network) to analyze and test its correctness and rationality. The experimental results show that OISDD is feasible and efficient.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Yingmo Jie, Mingchu Li, Tingting Tang and Cheng Guo, "Optimal Allocation Strategy Based on Stackelberg Game for Inspecting Drunk Driving on Traffic Network," KSII Transactions on Internet and Information Systems, vol. 11, no. 12, pp. 5759-5779, 2017. DOI: 10.3837/tiis.2017.12.005

[ACM Style]
Jie, Y., Li, M., Tang, T., and Guo, C. 2017. Optimal Allocation Strategy Based on Stackelberg Game for Inspecting Drunk Driving on Traffic Network. KSII Transactions on Internet and Information Systems, 11, 12, (2017), 5759-5779. DOI: 10.3837/tiis.2017.12.005