arXiv (All)
open access
The speed of convergence in the Cooper-Dutle dueling game
In 2013 Cooper and Dutle invented a dueling scenario where Alice and Bob shoot at each other until one is hit. Each shot is successful with some fixed probability $p$, $0 < p < 1$. The shooting order is given by a greedy algorithm, where at each step a shot is assigned to the player whose current pr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Complexity of Nash Equilibrium in Network Congestion and Coordination Games#1117937
- Ramsey achievement games on graphs : algorithms and bounds#796468
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Making spanning graphs#1122858
- Coalitions in Repeated Games#131167
Record · ID 1048324
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive