title: Acceptable Points in Games with Preference Relations
metadata.name: dc.contributor.author
metadata.value: Rozen, Victor V.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2018-07-24T11:21:07Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2018-07-24T11:21:07Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2018
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/10481
metadata.lang: -
metadata.name: dc.description
metadata.value: In Contributions to game theory and management, vol. XI. Collected papers presented on the Eleventh International Conference Game Theory and Management / Editors Leon A. Petrosyan, Nikolay A. Zenkevich. - SPb.: Saint Petersburg State University, 2018. - 330 p.
  The collection contains papers accepted for the Eleventh International Game Theory and Management (June 28-30, 2017, St. Petersburg State University, St. Petersburg, Russia).
metadata.lang: en_GB
metadata.name: dc.description.abstract
metadata.value: For games with preference relations we introduce an acceptability concept. An outcome of a game is called an acceptable one if no players which have an objection to it in the form of some strategy (all of the required definitions clarified in the introduction, see section 1). It is easy to show that every outcome at equilibrium point is an acceptable one but the converse is false. An aim of this article is a finding of conditions for existence of acceptable outcomes for games with preference relations (see sections 2 and 3).
  These conditions relate both to strategies and the preference relations ofcthe players. The main requirements
  concerning the preference relations are acyclic and transitivity. It is a very important fact, that for game in which
  the sets of strategies of players are finite, the set of acceptable outcomes is non empty. For the class of games with payoff function acceptability condition is equivalent to individual rationality condition. An example of infinite
  game in which the set of acceptable outcomes is empty is given in section 4.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: Saint Petersburg State University
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: game with preference relations
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Nash equilibrium point
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: general equilibrium point
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: acceptable point
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Acceptable Points in Games with Preference Relations
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Other
metadata.lang: en_GB