IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v94y1997i2d10.1023_a1022639813629.html
   My bibliography  Save this article

Accumulation Games, Part 1: Noisy Search

Author

Listed:
  • K. Kikuta

    (Toyama University)

  • W. H. Ruckle

    (Clemson University)

Abstract

In an accumulation game, a hider places objects at locations, and a seeker examines these locations. If the seeker discovers an object, the seeker confiscates it. The goal of the hider is to accumulate a certain number of objects before a given time, and the goal of the seeker is to prevent this. In this paper, we first classify various possible variations on the accumulation game. Next, we discuss the so-called noisy accumulation game in which the hider can observe each action of the seeker. We present the solution of this game for all but some marginal cases and illustrate it with computational examples.

Suggested Citation

  • K. Kikuta & W. H. Ruckle, 1997. "Accumulation Games, Part 1: Noisy Search," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 395-408, August.
    • Handle: RePEc:spr:joptap:v:94:y:1997:i:2:d:10.1023_a:1022639813629
    DOI: 10.1023/A:1022639813629
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022639813629
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022639813629?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. William H. Ruckle, 1992. "The reporting time problem: Integration of intelligence with verification," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(7), pages 893-903, December.
    2. William H. Ruckle, 1992. "The Upper Risk of an Inspection Agreement," Operations Research, INFORMS, vol. 40(5), pages 877-884, October.
    3. Garnaev, Andrej Yu, 1992. "On Simple MIX Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 237-247.
    4. Kensaku Kikuta & William H. Ruckle, 1994. "Initial point search on weighted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 821-831, October.
    5. Garnaev, A Yu, 1992. "A Remark on the Princess and Monster Search Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 269-276.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. N. Zoroa & M. J. Fernández-Sáez & P. Zoroa, 1999. "A Game Related to the Number of Hides Game," Journal of Optimization Theory and Applications, Springer, vol. 103(2), pages 457-473, November.
    2. Dömötör Pálvölgyi, 2018. "All or Nothing Caching Games with Bounded Queries," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 20(01), pages 1-9, March.
    3. Bastián Bahamondes & Mathieu Dahan, 2024. "Hide-and-Seek Game with Capacitated Locations and Imperfect Detection," Decision Analysis, INFORMS, vol. 21(2), pages 110-124, June.
    4. Steve Alpern & Robbert Fokkink & Christos Pelekis, 2012. "A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 650-661, June.
    5. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    6. Endre Csóka & Thomas Lidbetter, 2016. "The solution to an open problem for a caching game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(1), pages 23-31, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    2. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    3. Vic Baston & Kensaku Kikuta, 2015. "Search games on a network with travelling and search costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 347-365, May.
    4. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    5. Steve Alpern, 2011. "A New Approach to Gal’s Theory of Search Games on Weakly Eulerian Networks," Dynamic Games and Applications, Springer, vol. 1(2), pages 209-219, June.
    6. Zoroa, N. & Zoroa, P. & Fernández-Sáez, M.J., 2009. "Weighted search games," European Journal of Operational Research, Elsevier, vol. 195(2), pages 394-411, June.
    7. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
    8. Andrey Garnaev & Kensaku Kikuta, 2014. "Screening and hiding versus search," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 255-265, December.
    9. N. Zoroa & M. J. Fernández-Sáez & P. Zoroa, 1999. "A Game Related to the Number of Hides Game," Journal of Optimization Theory and Applications, Springer, vol. 103(2), pages 457-473, November.

    More about this item

    Keywords

    Zero-sum games; search games;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:94:y:1997:i:2:d:10.1023_a:1022639813629. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.