An approximation algorithm for computing a tipping set in super modular games for interdependent security

被引：1

作者：

Cremeans, B. ^{[1
]}

Lakshmivarahan, S. ^{[1
]}

Dhall, S. K. ^{[1
]}

机构：

[1] Univ Oklahoma, Sch Comp Sci, Norman, OK 73072 USA

来源：

COMPLEX ADAPTIVE SYSTEMS 2012 | 2012年 / 12卷

关键词：

Tipping; Game Theory;

D O I：

10.1016/j.procs.2012.09.094

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The problem of finding the minimal tipping set in a super modular game is known to be NP-hard. In this paper, we derive an approximation algorithm to find a minimal tipping set. In the special case of the uniform game, the approximation provides the exact result.

引用

页码：404 / 411

页数：8