| Article ID: | iaor20119078 |
| Volume: | 68 |
| Issue: | 3 |
| Start Page Number: | 333 |
| End Page Number: | 338 |
| Publication Date: | Aug 2011 |
| Journal: | Queueing Systems |
| Authors: | Last Gnter, Bordenave Charles, Foss Sergey |
| Keywords: | queues: theory |
This note introduces a greedy walk on Poisson and Binomial processes, which is a close relative to the well‐known greedy server model. Some open problems are presented.