Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
The University of North Carolina at
1
0
1
The algorithm achieves optimal regret bounds while learning unknown choice parameters from both customers and sellers, revolutionizing dynamic assortment strategies in online platforms.