Support Set Invariancy for Interval Bimatrix Games

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10401027" target="_blank" >RIV/00216208:11320/19:10401027 - isvavai.cz</a>

Result on the web

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=J4fj4ROgb_" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=J4fj4ROgb_</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218488519500107" target="_blank" >10.1142/S0218488519500107</a>

Result language

angličtina

Original language name

Support Set Invariancy for Interval Bimatrix Games

Original language description

Traditionally, game theory problems were considered for exact data, and the decisions were based on known payoffs. However, this assumption is rarely true in practice. Uncertainty in measurements and imprecise information must be taken into account. The interval-based approach for handling such uncertainties assumes that one has lower and upper bounds on payoffs. In this paper, interval bimatrix games are studied. Especially, we focus on three kinds of support set invariancy. Support of a mixed strategy consists of that pure strategies having positive probabilities. Given an interval-valued bimatrix game and supports for both players, the question states as follows: Does every bimatrix game instance have an equilibrium with the prescribed support? The other two kinds of invariancies are slight modifications: Has every bimatrix game instance an equilibrium being a subset/superset of the prescribed support? It is computationally difficult to answer these questions: the first case costs solving a large number of linear programs or mixed integer programs. For the remaining two cases a sufficient condition and a necessary condition are proposed, respectively.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

50201 - Economic Theory

Project

<a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems

ISSN

0218-4885

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

2

Country of publishing house

SG - SINGAPORE

Number of pages

13

Pages from-to

225-237

UT code for WoS article

000463236100003

EID of the result in the Scopus database

2-s2.0-85063967131