# Analyzing Incentives for Protocol Compliance in Complex Domains: A Case Study of Introduction-Based Routing

@article{Wellman2013AnalyzingIF, title={Analyzing Incentives for Protocol Compliance in Complex Domains: A Case Study of Introduction-Based Routing}, author={Michael P. Wellman and Tae Hyung Kim and Quang Duong}, journal={ArXiv}, year={2013}, volume={abs/1306.0388} }

Formal analyses of incentives for compliance with network protocols often appeal to gametheoretic models and concepts. Applications of game-theoretic analysis to network security have generally been limited to highly stylized models, where simplified environments enable tractable study of key strategic variables. We propose a simulation-based approach to gametheoretic analysis of protocol compliance, for scenarios with large populations of agents and large policy spaces. We define a general… Expand

#### Figures, Tables, and Topics from this paper

#### 21 Citations

Empirical Game-Theoretic Analysis of an Adaptive Cyber-Defense Scenario (Preliminary Report)

- Computer Science
- GameSec
- 2014

We investigate an adaptive cyber-defense scenario, where an attacker’s ability to compromise a targeted server increases progressively with probing, and the defender can erase attacker progress… Expand

Economic Incentives for Cybersecurity: Using Economics to Design Technologies Ready for Deployment

- Engineering, Computer Science
- ISSE
- 2013

Whereas security economics focuses on the cost/benefit analysis and supply/demand, it is believed that more sophisticated theoretical approaches, such as economic modeling, rarely utilized, would derive greater societal benefits. Expand

Bounds and dynamics for empirical game theoretic analysis

- Computer Science
- Autonomous Agents and Multi-Agent Systems
- 2019

Borders for empirical game theoretical analysis of complex multi-agent interactions are introduced and insights in the empirical meta game are provided showing that a Nash equilibrium of the estimated meta-game is an approximate Nashilibrium of the true underlying meta- game. Expand

Multiagent Evaluation under Incomplete Information

- Computer Science
- NeurIPS
- 2019

Adapt algorithms for accurate ranking, provide correctness and sample complexity guarantees, then introduce a means of connecting uncertainties in noisy match outcomes to uncertainties in rankings, to evaluate the performance of these approaches in several domains. Expand

Empirical Game-Theoretic Analysis for Moving Target Defense

- Engineering, Computer Science
- MTD@CCS
- 2015

It is found that the efficacy of deterrent defense is critically sensitive to detection capability, and in the absence of perfect detection the defender is often driven to proactive moving-target actions. Expand

Strategic formation of credit networks

- Computer Science
- ACM Trans. Internet Techn.
- 2015

This work studies the formation of credit networks when agents strategically decide how much credit to extend each other, and simulates a second case where agents may have varying information about each others' trustworthiness based on their distance in a social network. Expand

Improved Algorithms for Learning Equilibria in Simulation-Based Games

- Computer Science
- AAMAS
- 2020

It is shown that GS using the authors' variancesensitive bounds outperforms previous work, and that PSP can significantly outperform GS, which “outperform” means achieving the same guarantees with far fewer samples. Expand

A Strategic Analysis of Portfolio Compression

- Computer Science
- AAMAS
- 2021

The results show that some simple strategies based on local information perform better than the unconditional strategies of always agreeing or disagreeing to a compression and that when the decision is made strategically, the price of anarchy is always high. Expand

Thesis Proposal: Approximate Game Theoretic Analysis of Large Simulation-Based Games

- 2014

Multiagent simulation extends the reach of game-theoretic analysis to scenarios where payoff functions can be computed from implemented agent strategies. However this approach is limited by the… Expand

Learning Deviation Payoffs in Simulation-Based Games

- Computer Science
- AAAI
- 2019

It is demonstrated empirically that deviation payoff learning identifies better approximate equilibria than previous methods and can handle more difficult settings, including games with many more players, strategies, and roles. Expand

#### References

SHOWING 1-10 OF 29 REFERENCES

Incentivizing Responsible Networking via Introduction-Based Routing

- Computer Science
- TRUST
- 2011

It is argued that IBRP scales to Internet-sized networks, and can be deployed as an overlay on the current Internet, requiring no modifications to applications, operating systems or core network services, thus minimizing cost of adoption. Expand

Evolutionary mechanism design: a review

- Computer Science
- Autonomous Agents and Multi-Agent Systems
- 2009

Alternative approaches to mechanism design are reviewed which treat it as an engineering problem and bring to bear engineering design principles, viz.: iterative step-wise refinement of solutions, and satisficing instead of optimization in the face of intractable complexity. Expand

Using game theory to analyze wireless ad hoc networks

- Computer Science
- IEEE Communications Surveys & Tutorials
- 2005

This article describes how various interactions in wireless ad hoc networks can be modeled as a game, which allows the analysis of existing protocols and resource management schemes, as well as the design of equilibrium-inducing mechanisms that provide incentives for individual users to behave in socially-constructive ways. Expand

On optimal decisions in an introduction-based reputation protocol

- Computer Science
- 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
- 2013

This paper models the main decision process in an introduction-based reputation protocol, namely that of continuing/closing an active connection, as a sequential detection problem in which each stage corresponds to a transaction that is (perhaps erroneously) classified as either benign or harmful. Expand

Secure or insure?: a game-theoretic analysis of information security games

- Computer Science
- WWW
- 2008

In the weakest-target game, an interesting result is that, for almost all parameter settings, more effort is exerted at Nash equilibrium than at the social optimum, which may be attributed to the "strategic uncertainty" of players seeking to self-protect at just slightly above the lowest protection level. Expand

On selfish behavior in CSMA/CA networks

- Computer Science
- Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
- 2005

A game-theoretic approach is used to investigate the problem of the selfish behavior of nodes in CSMA/CA networks, and a simple, localized and distributed protocol is developed that successfully guides multiple selfish nodes to a Pareto-optimal Nash equilibrium. Expand

Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games

- Computer Science
- AAAI
- 2005

To deal with exponential growth in the size of a game with the number of agents, an approximation based on a hierarchy of reduced games is proposed, and methods for game-theoretic reasoning over incompletely-specified games at multiple levels of granularity are demonstrated. Expand

A Survey of Game Theory as Applied to Network Security

- Computer Science
- 2010 43rd Hawaii International Conference on System Sciences
- 2010

This paper surveys the existing game theoretic solutions which are designed to enhance network security and presents a taxonomy for classifying the proposed solutions and should provide the reader with a better understanding of game theory solutions to a variety of cyber security problems. Expand

Learning equilibria of games via payoff queries

- Computer Science, Mathematics
- EC '13
- 2013

This work studies a corresponding computational learning model, and the query complexity of learning equilibria for various classes of games, and has the stronger result that an equilibrium can be identified while only learning a small fraction of the cost values. Expand

Searching for approximate equilibria in empirical games

- Computer Science
- AAMAS
- 2008

Two algorithms are proposed, applicable to distinct models of the search process, that determine the exact payoff for a designated pure-strategy profile in the revealed- payoff model and the noisy-payoff model. Expand