Unverified50% confidenceFactExact time
In asynchronous multi-player multi-armed bandits (MMAB) where the players' activation probabilities differ from one another, solving for the optimal centralized assignment is NP-hard.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedHeterogeneous activation probabilities cause the optimal strategy to have to weigh the problem of preferentially occupying scarce arms, which is equivalent to a combinatorial optimization problem with conflict constraints, and the feasible assignment space grows exponentially with the number of players and the number of arms.72% similarUnverifiedUnder the homogeneous player assumption, the optimal centralized assignment can be simply characterized, and the difficulty of the problem is greatly reduced.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1023897API
curl https://kongchang.com/api/v1/knowledge/claims/1023897MCP
get_claim(id=1023897)