Two Approaches for Solving a Group Pursuit Game

Standard

Two Approaches for Solving a Group Pursuit Game. / Pankratova, Y.; Tarashnina, S.

In: Contributions to Game Theory and Management, Vol. 6, 2013, p. 362–376.

Research output: Contribution to journal › Article › peer-review

Author

Pankratova, Y. ; Tarashnina, S. / Two Approaches for Solving a Group Pursuit Game. In: Contributions to Game Theory and Management. 2013 ; Vol. 6. pp. 362–376.

BibTeX

@article{14e3d3583d0948da90296f2ab8d7ba6e,

title = "Two Approaches for Solving a Group Pursuit Game",

abstract = "In this paper we study a game of group pursuit in which players move on a plane with bounded velocities. The game is supposed to be a nonzero-sum simple pursuit game between a pursuer and m evaders acting independently of each other. The case of complete information is considered. Here we assume that the evaders are discriminated. Two diﬀerent approaches to formalize this pursuit problem are considered: noncooperative and cooperative. In a noncooperative case we construct a Nash equilibrium, and in a cooperative case we construct the core. We proved that the core is not empty for any initial positions of the players.",

author = "Y. Pankratova and S. Tarashnina",

year = "2013",

language = "English",

volume = "6",

pages = "362–376",

journal = "Contributions to Game Theory and Management",

issn = "2310-2608",

}

RIS

TY - JOUR

T1 - Two Approaches for Solving a Group Pursuit Game

AU - Pankratova, Y.

AU - Tarashnina, S.

PY - 2013

Y1 - 2013

N2 - In this paper we study a game of group pursuit in which players move on a plane with bounded velocities. The game is supposed to be a nonzero-sum simple pursuit game between a pursuer and m evaders acting independently of each other. The case of complete information is considered. Here we assume that the evaders are discriminated. Two diﬀerent approaches to formalize this pursuit problem are considered: noncooperative and cooperative. In a noncooperative case we construct a Nash equilibrium, and in a cooperative case we construct the core. We proved that the core is not empty for any initial positions of the players.

AB - In this paper we study a game of group pursuit in which players move on a plane with bounded velocities. The game is supposed to be a nonzero-sum simple pursuit game between a pursuer and m evaders acting independently of each other. The case of complete information is considered. Here we assume that the evaders are discriminated. Two diﬀerent approaches to formalize this pursuit problem are considered: noncooperative and cooperative. In a noncooperative case we construct a Nash equilibrium, and in a cooperative case we construct the core. We proved that the core is not empty for any initial positions of the players.

UR - https://www.elibrary.ru/item.asp?id=21399219

M3 - Article

VL - 6

SP - 362

EP - 376

JO - Contributions to Game Theory and Management

JF - Contributions to Game Theory and Management

SN - 2310-2608

ER -

ID: 5656052