8 citations · 13 across the 7 of their papers we have counts for
7 papers
Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
Keqin Liu, Richard Weber, Chengzhong Zhang
We consider a class of restless bandit problems that finds a broad application area in reinforcement learning and stochastic optimization. We consider independent discrete-time…
Optimal pricing for peer-to-peer sharing with network externalities
Yunpeng Li, Costas Courcoubetis, Lingjie Duan +1
In this paper, we analyse how a peer-to-peer sharing platform should price its service (when imagined as an excludable public good) to maximize profit, when each user's participati…
A more general Pandora's rule?
Wojciech Olszewski, Richard Weber
In a classic model analysed by Weitzman an agent is presented with boxes containing prizes. She may open boxes in any order, discover prizes within, and optimally stop. She wishes…
The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4
Richard Weber
We consider the symmetric rendezvous search game on a complete graph of n locations. In 1990, Anderson and Weber proposed a strategy in which, over successive blocks of n-1 steps,…
The optimal strategy for symmetric rendezvous search on K3
Richard Weber
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). Th…
Optimal Scheduling of Peer-to-Peer File Dissemination
Jochen Mundinger, Richard R. Weber, Gideon Weiss
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Interne…