Approximate solutions for expanding search games on general networks
Year of publication: |
2019
|
---|---|
Authors: | Alpern, Steve ; Lidbetter, Thomas |
Published in: |
Annals of operations research ; volume 275, numbers 2 (April 2019). - New York, NY, USA : Springer. - 2019, p. 259-279
|
Subject: | Spieltheorie | Game theory | Suchtheorie | Search theory |
-
Ke, T. Tony, (2020)
-
Keyword management costs and "broad match" in sponsored search advertising
Amaldoss, Wilfred, (2016)
-
On submodular search and machine scheduling
Fokkink, Robbert, (2019)
- More ...
-
Optimizing periodic patrols against short attacks on the line and other networks
Alpern, Steve, (2019)
-
Papadaki, Katerina, (2016)
-
Optimal trade-off between speed and acuity when searching for a small object
Alpern, Steve, (2015)
- More ...