OpenAlex
PricingAboutJobs
Log inGet started
Work

Dynamic Regret of Quantized Distributed Online Bandit Optimization in Zero-Sum Games

HTML

Year: 2025
Type: article
Source: IEEE Transactions on Cybernetics
DOI: 10.1109/tcyb.2025.3604774
Authors: Lan Liao, Daniel W. C. Ho, Deming Yuan, Zhan Yu, Baoyong Zhang, Shengyuan Xu
Institutions: Nanjing University of Science and Technology, City University of Hong Kong, Hong Kong Baptist University
Language: English

Topic: Advanced Bandit Algorithms Research
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences

Open Access status: closed

Funder: National Natural Science Foundation of China
Awards: G3065077844, G3447832710, G5618886522, G8206657436
OpenAlex ID: W4414265677
FWCI: 3.179
Cites: 27
Cited by: 4
Related to:
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms