On a class of simultaneous pursuit games.

Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first player choose points in the set A and let the second one do those in the set B. We understand the payoff function as the mean value of the distance between these points. The goal of the first player is to...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibragimov, Gafurjan I., Satimov, Numan
Format: Article
Language:English
English
Published: Springer Link 2012
Online Access:http://psasir.upm.edu.my/id/eprint/24977/1/On%20a%20class%20of%20simultaneous%20pursuit%20games.pdf
http://psasir.upm.edu.my/id/eprint/24977/
http://link.springer.com/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.24977
record_format eprints
spelling my.upm.eprints.249772015-09-22T04:01:27Z http://psasir.upm.edu.my/id/eprint/24977/ On a class of simultaneous pursuit games. Ibragimov, Gafurjan I. Satimov, Numan Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first player choose points in the set A and let the second one do those in the set B. We understand the payoff function as the mean value of the distance between these points. The goal of the first player is to minimize the mean value, while that of the second player is to maximize it. We study the structure of optimal mixed strategies and calculate the game value. Springer Link 2012-05 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/24977/1/On%20a%20class%20of%20simultaneous%20pursuit%20games.pdf Ibragimov, Gafurjan I. and Satimov, Numan (2012) On a class of simultaneous pursuit games. Russian Mathematics , 56 (5). pp. 39-46. ISSN 1066-369X http://link.springer.com/ 10.3103/S1066369X12050052 English
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
English
description Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first player choose points in the set A and let the second one do those in the set B. We understand the payoff function as the mean value of the distance between these points. The goal of the first player is to minimize the mean value, while that of the second player is to maximize it. We study the structure of optimal mixed strategies and calculate the game value.
format Article
author Ibragimov, Gafurjan I.
Satimov, Numan
spellingShingle Ibragimov, Gafurjan I.
Satimov, Numan
On a class of simultaneous pursuit games.
author_facet Ibragimov, Gafurjan I.
Satimov, Numan
author_sort Ibragimov, Gafurjan I.
title On a class of simultaneous pursuit games.
title_short On a class of simultaneous pursuit games.
title_full On a class of simultaneous pursuit games.
title_fullStr On a class of simultaneous pursuit games.
title_full_unstemmed On a class of simultaneous pursuit games.
title_sort on a class of simultaneous pursuit games.
publisher Springer Link
publishDate 2012
url http://psasir.upm.edu.my/id/eprint/24977/1/On%20a%20class%20of%20simultaneous%20pursuit%20games.pdf
http://psasir.upm.edu.my/id/eprint/24977/
http://link.springer.com/
_version_ 1643828521325297664
score 13.211869