Game based Resource Allocation Scheme for Dynamic Environments

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In this paper, we propose a new strategic security resource allocation scheme based on the Blotto game. In the Blotto game, players are tasked to simultaneously distribute limited resources over several objects. For the efficient security resource allocation, the proposed game model constitutes a class of repeated two-person game while employing the iterative learning approach to approximate an optimal solution. A simulation shows that our proposed scheme can effectively respond the current conditions and obtain better performance than other existing scheme under dynamically changeable environments.

키워드

Security Resource AllocationBlotto GameLearning-based game modelRepeated ApproachStrategic Negotiation
제목
Game based Resource Allocation Scheme for Dynamic Environments
저자
Park, YoungjaeKim, Sungwook
DOI
10.1109/HPCC-CSS-ICESS.2015.195
발행일
2015-11-23
유형
Proceedings Paper
저널명
2015 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2015 IEEE 7TH INTERNATIONAL SYMPOSIUM ON CYBERSPACE SAFETY AND SECURITY, AND 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS (ICESS)
페이지
852 ~ 854