共 50 条
- [41] Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
- [42] A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1101 - 1109