Complexity of inheritance of F-convexity for restricted games induced by minimum partitions

Alexandre Skoda ()
Additional contact information
Alexandre Skoda: UP1 - Université Paris 1 Panthéon-Sorbonne, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique

Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL

Keywords: Cooperative game; restricted game; graph partitions; convexity; complexity (search for similar items in EconPapers)
Date: 2020-01
References: Add references at CitEc
Citations:

Published in RAIRO - Operations Research, 2020, 54 (1), pp.143-161. ⟨10.1051/ro/2019003⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:cesptp:halshs-02083135

DOI: 10.1051/ro/2019003

Access Statistics for this paper

More papers in Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
Bibliographic data for series maintained by CCSD ().