title: Computation Problems for Envy Stable Solutions of Allocation Problems with Public Resources
metadata.name: dc.contributor.author
metadata.value: Naumova, Natalia I.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2021-11-29T20:41:25Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2021-11-29T20:41:25Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2021-10
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Naumova N. I. Computation Problems for Envy Stable Solutions of Allocation Problems with Public Resources. Contributions to Game Theory and Management, XIV, 302-311.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu31.2021.22
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/33704
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: We consider generalizations of TU games with restricted cooperation
  in partition function form and propose their interpretation as allocation
  problems with several public resources. Either all resources are goods or all
  resources are bads. Each resource is distributed between points of its set and
  permissible coalitions are subsets of the union of these sets. Each permissible
  coalition estimates each allocation of resources by its gain/loss function, that
  depends only on the restriction of the allocation on that coalition. A solution
  concept of "fair" allocation (envy stable solution) was proposed by the author
  in (Naumova, 2019). This solution is a simplification of the generalized
  kernel of cooperative games and it generalizes the equal sacrifice solution for
  claim problems. An allocation belongs to this solution if there do not exist
  special objections at this allocation between permissible coalitions. For several
  classes of such problems we describe methods for computation selectors
  of envy stable solutions.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Contributions to Game Theory and Management;Volume 14
metadata.lang: -
metadata.name: dc.subject
metadata.value: Wardrop equilibrium
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: envy stable solution
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: games with restricted cooperation
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: equal sacrifice solution
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Computation Problems for Envy Stable Solutions of Allocation Problems with Public Resources
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 302-311.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/33704/1/302-311.pdf
resources.format: Adobe PDF
resources.size: 388,66 kB