Inheritance of Convexity for the P_-Restricted Game

08/08/2017
by   Alexandre Skoda, et al.
0

We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the subcomponents corresponding to a minimum partition. This minimum partition P_ is induced by the deletion of the minimum weight edges. We provide a characterization of the graphs satisfying inheritance of convexity from the underlying game to the restricted game associated with Pmin.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2020

Inheritance of Convexity for the 𝒫̃_min-Restricted Game

We consider a restricted game on weighted graphs associated with minimum...
research
06/28/2022

Weighted Average-convexity and Cooperative Games

We generalize the notion of convexity and average-convexity to the notio...
research
11/08/2019

On the Convexity of Independent Set Games

This paper investigates independent set games (introduced by Deng et al....
research
10/18/2020

Arboricity Games: the Core and the Nucleolus

The arboricity of a network is the minimum number of forests needed to c...
research
11/30/2017

Approximating Connected Safe Sets in Weighted Trees

For a graph G and a non-negative integral weight function w on the verte...
research
04/24/2023

The Game Chromatic Number of Complete Multipartite Graphs with No Singletons

In this paper we investigate the game chromatic number for complete mult...

Please sign up or login with your details

Forgot password? Click here to reset