paper-with-me

Papers

Payoff distribution in robust coalitional games on time-varying networks

2020-10-16

In this paper, we consider a sequence of transferable utility (TU) coalitional games where the coalitional values are unknown but vary within certain bounds. As a solution to the resulting family of games, we formalise the notion of "robust CORE". Our main contribution is to design two distributed algorithms, namely, distributed payoff allocation and distributed bargaining, that converge to a consensual payoff distribution in the robust CORE. We adopt an operator-theoretic perspective to show convergence of both algorithms executed on time-varying communication networks. An energy storage optimization application motivates our framework for "robust coalitional games".

📄 PDF Abstract BibTeX arXiv:2009.03783

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Online coalitional games for real-time payoff distribution with applications to energy markets

2023-01-28 · Aitazaz Ali Raja, Sergio Grammatico

Motivated by the markets operating on fast time scales, we present a framework for online coalitional games with time-varying coalitional values and propose real-time payoff distribution mechanisms. Specifically, we desi…

Coalitional Manipulations and Immunity of the Shapley Value

2023-10-31 · Christian Basteck, Frank Huettner

We consider manipulations in the context of coalitional games, where a coalition aims to increase the total payoff of its members. An allocation rule is immune to coalitional manipulation if no coalition can benefit from…

Fair Indivisible Payoffs through Shapley Value

2025-10-28 · Mikołaj Czarnecki, Michał Korniak, Oskar Skibski, Piotr Skowron arxiv

We consider the problem of payoff division in indivisible coalitional games, where the value of the grand coalition is a natural number. This number represents a certain quantity of indivisible objects, such as parliamen…

Image Classification

Multi-agent online learning in time-varying games

2018-09-10 · Benoit Duvocelle, Panayotis Mertikopoulos, Mathias Staudigl, Dries Vermeulen

We examine the long-run behavior of multi-agent online learning in games that evolve over time. Specifically, we focus on a wide class of policies based on mirror descent, and we show that the induced sequence of play (a…

Coalitional Games with Stochastic Characteristic Functions and Private Types

2019-10-25 · Dengji Zhao, Yiqing Huang, Liat Cohen, Tal Grinshpoun

The research on coalitional games has focused on how to share the reward among a coalition such that players are incentivised to collaborate together. It assumes that the (deterministic or stochastic) characteristic func…