Calhoun
metadata only
The analysis of shooting problems via generalised bandits
A single Red wishes to shoot at a collection of Blue targets in order to maximize some measure of return obtained from Blues killed before Red's own demise. While the class of decision processes called multi-armed bandits has been previously deployed to develop optimal policies for Red, we argue the
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
- Independent natural extension for choice functions#84673
- Throughput Optimization for Multi-AP IEEE P802.11bq Networks Based on Combinatorial Multi-Armed Bandits#259411
- Bandits in Prod: Hyperparameter Optimization at Inference Time#627702
- MESHA: Mechanism-Enforced Sequential Halving for Strategic Linear Bandits#373413
- A (Moral) Prisoner's Dilemma: Character Ethics and Plea Bargaining#741628
Record · ID 779865
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