#3249. Answers set programs for non-transferable utility games: Expressiveness, complexity and applications

October 2026publication date
Proposal available till 14-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Arts and Humanities (miscellaneous);
Developmental and Educational Psychology;
Experimental and Cognitive Psychology;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №3249.1 Contract №3249.2 Contract №3249.3 Contract №3249.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Coalitional games are mathematical models suited to study payoff distribution problems in cooperative scenarios. In abstract terms, a coalitional game can be specified by explicitly listing all possible coalitions with their associated distributions. To date, a plethora of compact encodings have been already introduced and analyzed from the algorithm and computational viewpoints. These encodings typically share the assumption that the utility associated with a coalition can be freely transferred among agents. The research addresses this issue by proposing a compact encoding for representing and reasoning about the outcomes of NTU coalitional games. The proposed representation can succinctly encode several games of interest within a wide range of application domains. Eventually, a prototype system supporting the proposed framework has been implemented by leveraging a state-of-the-art answer set engine.
Keywords:
Answer set programming; Coalitional games; Computational complexity; Game theory; NTU games

Contacts :
0