Skip to Main content Skip to Navigation
Conference papers

Jeux incomplets algébriques

Abstract : This article proposes an algebraic approach to incompletegames allowing the modelling of problems where the agentshave different types of knowledge, complex utility functions(bi-criteria for example) and can use a whole family ofdecision rules. We show that, when the plausibility measureis decomposable, such games can be transformed in lineartime into hypergraphical games (without uncertainty), thusgeneralizing algebraically and to any number of playersHowson and Rosental’s Theorem.
Document type :
Conference papers
Complete list of metadata
Contributor : Abir B. Karami Connect in order to contact the contributor
Submitted on : Friday, July 23, 2021 - 8:20:21 PM
Last modification on : Monday, July 4, 2022 - 8:53:34 AM
Long-term archiving on: : Sunday, October 24, 2021 - 6:59:03 PM


Files produced by the author(s)


  • HAL Id : hal-03298722, version 1


Hélène Fargier, Érik Martin-Dorel, Pierre Pomeret-Coquot. Jeux incomplets algébriques. Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2021) @ Plate-Forme Intelligence Artificielle (PFIA 2021), Jul 2021, Bordeaux, France. pp.46-53. ⟨hal-03298722⟩



Record views


Files downloads