no code implementations • 21 Dec 2022 • Asaf Cohen, Vijay G. Subramanian, Yili Zhang
We show that the algorithm achieves an $O(1)$ regret when all optimal thresholds with full information are non-zero, and achieves an $O(\ln^{1+\epsilon}(N))$ regret for any specified $\epsilon>0$, in the case that an optimal threshold with full information is $0$ (i. e., an optimal policy is to reject all arrivals), where $N$ is the number of arrivals.
no code implementations • 14 Feb 2022 • Shih-Tang Su, Vijay G. Subramanian
Persuasion games with multiple senders have largely studied simultaneous commitment and signalling settings.
no code implementations • 18 Oct 2021 • Shih-Tang Su, Vijay G. Subramanian, Grant Schoenebeck
The non-determined experiments (signals) in the multi-phase trial are to be chosen by the sender in order to persuade the receiver best.