KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Jie, Yingmo (School of Mathematical Sciences, Dalian University of Technology) ;
  • Li, Mingchu (School of Software Technology, Dalian University of Technology) ;
  • Tang, Tingting (School of Software Technology, Dalian University of Technology) ;
  • Guo, Cheng (School of Software Technology, Dalian University of Technology)
  • Received : 2017.04.04
  • Accepted : 2017.08.18
  • Published : 2017.12.31
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. H. Von, Marktform und Gleichgewicht, 2nd Edition, Springer, New York, 1934.
  2. J. Pita, M. Jain, J. Marecki, F. Ordonez, C. Portway, M. Tambe, C. Western, P. Paruchuri and S. Kraus, "Deployed Armor protection: the application of a game theoretic model for security at the Los Angeles International Airport," in Proc. of 17th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 125-132, May 12-16, 2008.
  3. J. Tsai, S. Rathi, C. Kiekintveld, F. Ordonez and M. Tambe, "IRIS-a tool for strategic security allocation in transportation networks," in Proc. of 18th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 37-44, May 10-15, 2009.
  4. E. Shieh, B. An, R. Yang, M. Tambe, C. Baldwin, J. DiRenzo, B. Maule and G. Meyer, "Protect: an application of computational game theory for the security of the ports of the United States," in Proc. of 26th Association for the Advance of Artificial Intelligence, pp. 2173-2179, July 22-26, 2012.
  5. B. An, F. Ordonez, M. Tambe, E. Shieh, R. Yang, C. Baldwin, J. DiRenzo, K. Moretti, B. Maule and G. Meyer, "A deployed quantal response-based patrol planning system for the U.S. coast guard," Interfaces, vol. 43, no. 5, pp. 400-420, 2013. https://doi.org/10.1287/inte.2013.0700
  6. T. Nguyen, A. Sinha, S. Gholami, A. Plumptre, L. Joppa, M. Tambe, M. Driciru, F. Wanyama, A. Rwetsiba, R. Critchlow and C. Beale, "CAPTURE: A new predictive anti-poaching tool for wildlife protection," in Proc. of 25th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 509-540, May 9-13, 2016.
  7. F. Fang, T. Nguyen, R. Pickles, W. Lam, G. Clements, B. An, A. Singh, M. Tambe and A. Lemieux, "Deploying paws: Field optimization of the protection assistant for wildlife security" in Proc. of 28th Annual Conference on Innovative Applications of Artificial Intelligence, pp. 3966-3973, February 12-17, 2016.
  8. Z. Yin, A. Jiang, M. Tambe, C. Kiekintveld, K. Leyton-Brown, T. Sandholm and J. Sullivan, "Trusts: scheduling randomized patrols for fare inspection in transit systems using game theory" in Proc. of 24th Annual Conference on Innovative Applications of Artificial Intelligence, pp. 2348-2355, July 22-26, 2012.
  9. M. Brown, S. Saisubramanian, P. Varakantham and M. Tambe, "STREETS: game-theoretic traffic patrolling with exploration and exploitation," in Proc. of 28th Association for the Advance of Artificial Intelligence, pp. 2966-2971, July 27-31, 2014.
  10. J. Niu, W. Tang and W. Guo, "Coalition formation game based relay selection and frequency sharing for cooperative relay assisted wireless D2D networks with QoS constraints," KSII Transactions on Internet and Information Systems, vol. 10, no. 11, pp. 5253-5270, 2016. https://doi.org/10.3837/tiis.2016.11.003
  11. Lin, M. and Chen, Y, "Performance analysis of buffer aware scheduling for video services in LTE network," KSII Transactions on Internet and Information Systems, vol. 9, no. 9, pp. 3594-3610, 2015. https://doi.org/10.3837/tiis.2015.09.017
  12. V. Conitzer and T. Sandholm, "Computing the optimal strategy to commit to," EC, pp. 82-90, 2006.
  13. P. Varaiya, "Max pressure control of a network of signalized intersections," Transportation Research Part C: Emerging Technologies, vol. 36, pp. 177-195, 2013. https://doi.org/10.1016/j.trc.2013.08.014
  14. G. Becker and W. Landes, Essays in the economics of crime and punishment, Columbia University, 1974.
  15. M.T. Fillmore, J.S. Blackburn and L.R. Harrison, "Acute disinhibiting effects of alcohol as a factor in risky driving behavior," Drag and Alcohol Dependence, vol. 95, pp. 97-106, 2008. https://doi.org/10.1016/j.drugalcdep.2007.12.018
  16. M.E. Rakauskas, N.J. Ward, E.R. Boer, E.M. Bernat, M. Cadwallader and C.J. Patrick, "Combined effects of alcohol and distraction on driving performance," Accident Analysis and Prevention, vol. 40, pp. 1742-1749, 2008. https://doi.org/10.1016/j.aap.2008.06.009
  17. D. Korzhyk, V. Conitzer and R. Parr, "Complexity of computing optimal Stackelberg strategies in security resources allocation games," in Proc. of 24th Association for the Advance of Artificial Intelligence, pp. 805-810, July 11-15, 2010.
  18. J. Ponssard and S. Sorin, "The L.P. formulation of finite zero-sum games with incomplete information," International Journal of Game Theory, vol. 9, pp. 99-105, 1980. https://doi.org/10.1007/BF01769767
  19. D. Koller, N. Megiddo and B. von Stengel, "Fast algorithms for finding randomized strategies in game trees," in Proc. of 26th Annual ACM Symposium on Theory of Computing, pp. 750-760, May 23-25, 1994.
  20. P. Paruchuri and P. Pearce, "Playing games for security: an efficient exact algorithm for solving bayesian stackelberg games," in Proc. of 17th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 895-902, May 12-16, 2008.
  21. C. Kiekintveld and M. Jain, "Computing optimal randomized resource allocations for massive security games," in Proc. of 18th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 689-696, May 10-15, 2009.
  22. E.W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959. https://doi.org/10.1007/BF01386390
  23. H.W. Kuhn, "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955. https://doi.org/10.1002/nav.3800020109
  24. J. Smith and F. Cruz, "State dependent travel time models," Physica A Statistical Mechanics& Its Applications, vol. 395, no. 4, pp. 560-579, 2014. https://doi.org/10.1016/j.physa.2013.10.048