Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Link opens in a new tab
Search content at Tel Aviv University
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Cooperative multi-player bandit optimization
Ilai Bistritz
, Nicholas Bambos
Stanford University
Research output
:
Contribution to journal
›
Conference article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Cooperative multi-player bandit optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Reward Function
100%
Bandit Convex Optimization
100%
Multiplayer Bandits
100%
Unknown Function
50%
Continuously Differentiable Function
50%
Stationary Point
50%
Player Actions
50%
Ergodic Markov Chain
50%
Action-based
50%
Optimal Actions
50%
Communication Graph
50%
Gradient Ascent
50%
Action Sets
50%
Networked Environment
50%
Time-varying Graphs
50%
Distributed Learning Algorithm
50%
Compact Action
50%
Computer Science
Algorithm Converges
100%
Action Profile
100%
Learning Algorithm
50%
Unknown Function
50%
Optimal Action
50%
Communication Graph
50%
Distributed Learning
50%
Action-Set
50%
Stationary Point
50%
Markov Chain
50%
Mathematics
Probability Theory
100%
Stationary Point
50%
Ergodic Markov Chain
50%
Unknown Function
50%
Random Subset
50%
random time δ
50%