Name
Abstract | ||
|---|---|---|
This paper presents a group testing approach toward a security decision-making problem. We consider a game model for a network of firms where each firm decides to invest some amount, viewed as its action, on its security. The utility functions are then defined in such a way to capture the interdependent structure of the network. We propose and analyze two algorithms for the firms to update their investments based on incomplete information they receive at any given stage of the game. This so-called incomplete information, which is provided by an independent entity, is the outcome of a (security) test performed on a selected group of firms rather than a single firm due to privacy concerns. Our arguments finally lead to a number of fundamental group testing problems which are inherently different from the classical group testing problem and its alternative versions. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | Convergence (routing),Interdependence,Mathematical optimization,Computer science,Operations research,Fundamental group,Classical group,Group testing,Complete information |
DocType | ISSN | Citations |
Conference | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sadegh Bolouki | 1 | 18 | 6.92 |
| Donya G. Dobakhshari | 2 | 0 | 0.34 |
| Tamer Basar | 3 | 3497 | 402.11 |
| Vijay Gupta | 4 | 0 | 0.34 |
| Angelia Nedic | 5 | 2323 | 148.65 |