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...
Saved in:
| Main Authors: | , |
|---|---|
| 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!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English English |
| Summary: | 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. |
|---|