Search and Ambush Games with Capacities

N. Zoroa, M. J. Fernández-Sáez and P. Zoroa
Additional contact information
N. Zoroa: Universidad de Murcia
M. J. Fernández-Sáez: Universidad de Murcia
P. Zoroa: Universidad de Murcia

Journal of Optimization Theory and Applications, 2004, vol. 123, issue 2, No 11, 450 pages

Abstract: Abstract Search games with capacities are bipersonal zero-sum games where a player has to hide a number of objects or an amount of material in a fixed number of containers and his opponent attempts to locate them. In this article, we deal with games on a discrete structureless set and on a discrete set with linear order. In both cases, the capacities under consideration are continuous. Some of the games studied generalize previously studied games.

Keywords: Zero-sum games; search games; games with capacities (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-004-5157-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:123:y:2004:i:2:d:10.1007_s10957-004-5157-x

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-004-5157-x

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().