Linear-Time Resource Allocation in Security Games with Identical Fully Protective Resources
نویسندگان
چکیده
Game theory has become an important tools for making resource allocations decision in security domains, including critical infrastructure protection. Many of these games are formulated as Stackelberg security games. We present new analysis and algorithms for a class of Stackelberg security games with identical, fully protective defender resources. The first algorithm has worst-case complexity linear in the number of possible targets, but works only for a restricted case. The second algorithm can find and optimal resource allocation for the general case in time O(n · log(n)).
منابع مشابه
Towards Addressing Spatio - Temporal Aspects in Security Games by Fei
Game theory has been successfully used to handle complex resource allocation and patrolling problems in security and sustainability domains. More specifically, real-world applications have been deployed for different domains based on the framework of security games, where the defender (e.g., security agency) has a limited number of resources to protect a set of targets from an adversary (e.g., ...
متن کاملTowards Addressing Spatio - Temporal Aspects in Security Games by Fei Fang
Game theory has been successfully used to handle complex resource allocation and patrolling problems in security and sustainability domains. More specifically, real-world applications have been deployed for different domains based on the framework of security games, where the defender (e.g., security agency) has a limited number of resources to protect a set of targets from an adversary (e.g., ...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملPrice of Anarchy of Wireless Congestion Games
In this paper, we consider a resource allocation game with heterogenous players competing for limited resources. We model this as a singleton congestion game, where the share of each player is a decreasing function of the number of players selecting the same resource. In particular, we consider player-specific payoffs that depend not only on the shares of resource, but also on different prefere...
متن کاملPure Nash Equilibrium in A Capacitated Resource Allocation Game with Binary Preferences
A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when the number of resources is limited or the network h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011