Contributions to Game Theory and Management
RUS  ENG    ЖУРНАЛЫ   ПЕРСОНАЛИИ   ОРГАНИЗАЦИИ   КОНФЕРЕНЦИИ   СЕМИНАРЫ   ВИДЕОТЕКА   ПАКЕТ AMSBIB  
Общая информация
Последний выпуск
Архив

Поиск публикаций
Поиск ссылок

RSS
Последний выпуск
Текущие выпуски
Архивные выпуски
Что такое RSS



Contributions to Game Theory and Management:
Год:
Том:
Выпуск:
Страница:
Найти






Персональный вход:
Логин:
Пароль:
Запомнить пароль
Войти
Забыли пароль?
Регистрация


Contributions to Game Theory and Management, 2021, том 14, страницы 302–311
DOI: https://doi.org/10.21638/11701/spbu31.2021.22
(Mi cgtm404)
 

Computation problems for envy stable solutions of allocation problems with public resources

Natalia I. Naumova

St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia
Список литературы:
Аннотация: 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.
Ключевые слова: Wardrop equilibrium, envy stable solution, games with restricted cooperation, equal sacrifice solution.
Тип публикации: Статья
Язык публикации: английский
Образец цитирования: Natalia I. Naumova, “Computation problems for envy stable solutions of allocation problems with public resources”, Contributions to Game Theory and Management, 14 (2021), 302–311
Цитирование в формате AMSBIB
\RBibitem{Nau21}
\by Natalia~I.~Naumova
\paper Computation problems for envy stable solutions of allocation problems with public resources
\jour Contributions to Game Theory and Management
\yr 2021
\vol 14
\pages 302--311
\mathnet{http://mi.mathnet.ru/cgtm404}
\crossref{https://doi.org/10.21638/11701/spbu31.2021.22}
Образцы ссылок на эту страницу:
  • https://www.mathnet.ru/rus/cgtm404
  • https://www.mathnet.ru/rus/cgtm/v14/p302
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Обратная связь:
     Пользовательское соглашение  Регистрация посетителей портала  Логотипы © Математический институт им. В. А. Стеклова РАН, 2024