✦ LIBER ✦

A cooperative game in search theory

✍ Scribed by Ryusuke Hohzaki

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 168 KB
Volume: 56
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20338

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Effects of cueing in cooperative search

✍ David E. Jeffcoat; Pavlo A. Krokhmal; Olesya I. Zhupanska 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

A search game with a protector

✍ V.J. Baston; A.Y. Garnaev 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is

A search game on a cyclic graph

✍ Kensaku Kikuta 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

Zero-Knowledge Cooperation in Dilemma Ga

Zero-Knowledge Cooperation in Dilemma Games

✍ STEFFEN HUCK; HANS-THEO NORMANN; JÖRG OECHSSLER 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We consider a very simple adaptive rule that induces cooperative behavior in a large class of dilemma games. The rule has a Pavlovian flavor and can be described as win-continue, lose-reverse. It assumes no knowledge about the underlying structure of the environment (the "rules of the game") and req

Asymptotic results in search theory

✍ Ira Moskowitz; Jeff Simmen 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

This article addresses a basic problem in search theory concerning the future distribution of a target's location. Given an initial distribution of a target's location and a distribution for its constant velocity, what will its future distribution be? Asymptotics are used to obtain closed-form solut

A cooperative game of a pair of learning

A cooperative game of a pair of learning automata

✍ M.A.L. Thathachar; K.R. Ramakrishnan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 426 KB

A cooperative game played in a sequential manner by a pair of learning automata is investigated in this paper. The automata operate in an unknown random environment which gives a common pay-offto the automata. Necessary and sufficient conditions on the functions in the reinforcement scheme are given