Finding the Best Dueler
Consider a set of <i>n</i> players. We suppose that each game involves two players, that there is some unknown player who wins each game it plays with a probability greater than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"...
Main Authors: | Zhengu Zhang, Sheldon M. Ross |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/7/1568 |
Similar Items
-
On Gap-Based Lower Bounding Techniques for Best-Arm Identification
by: Lan V. Truong, et al.
Published: (2020-07-01) -
Multi-armed linear bandits with latent biases
by: Kang, Qiyu, et al.
Published: (2024) -
LEO-Assisted Aerial Deployment in Post-Disaster Scenarios Using a Combinatorial Bandit and Genetic Algorithmic Approach
by: Ehab Mahmoud Mohamed, et al.
Published: (2023-12-01) -
Multi-arm bandit-led clustering in federated learning
by: Zhao, Joe Chen Xuan
Published: (2024) -
On the Design of Chaos-Based S-Boxes
by: Miroslav M. Dimitrov
Published: (2020-01-01)