Defense against an opportunistic challenger: theory and experiments
From MaRDI portal
Publication:2630102
Recommendations
Cites work
- Behavior in all-pay auctions with incomplete information
- Brothers in arms -- an experiment on the alliance puzzle
- Can groups solve the problem of over-bidding in contests?
- Contest success functions
- Contest success functions: an extension
- Contests with group-specific public-good prizes
- Defending against multiple different attackers
- Experimental comparison of multi-stage and one-stage contests
- Group contest success functions
- Interdependent security
- Olson vs. Coase: coalitional worth in conflict
- Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.
- Optimal resource allocation for security in reliability systems
- Strategic defense and attack for series and parallel reliability systems
- The all-pay auction with complete information
- The selection efficiency of tournaments
Cited in
(9)- Strategy map concepts in a balanced scorecard cockpit improve performance
- An approximate solution to rent-seeking contests with private information
- Defense and attack of performance-sharing common bus systems
- Defending Against Opportunistic Criminals: New Game-Theoretic Frameworks and Algorithms
- Active vs. passive defense against a strategic attacker
- Brothers in arms -- an experiment on the alliance puzzle
- scientific article; zbMATH DE number 6438458 (Why is no real title available?)
- A contest model of balancing
- Defending against multiple different attackers
This page was built for publication: Defense against an opportunistic challenger: theory and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630102)