arXiv (OAI Expanded)
open access
QuadraSHAP: $ε$-Exact Shapley Values for Product Games in Logarithmic Parallel Time
We introduce QuadraSHAP, a method for $ε$-exact Shapley computation in product games, cooperative games whose coalition values factorize across players. Given a tolerance $ε\ge0$, the method determines a computational budget before evaluation, guaranteeing an absolute attribution error of at most $ε
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
- Simple games with minimum#1201854
- Preference-based Cooperation in a Prisoner's Dilemma Game: Whole Population Cooperation without Information Flow across Matches#1276045
- A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution#31341
- Equilibrium Play Without Mutual Knowledge of Rationality#1144849
- Data-Driven Games with Coherent Risk Measures#1249390
Record · ID 1242514
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