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

October 2026publication date
Proposal available till 08-06-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:
Artificial Intelligence;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №3725.1 Contract №3725.2 Contract №3725.3 Contract №3725.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. This naive representation quickly becomes infeasible over games involving many agents, thereby calling for suitable compact representations, that is, encoding mechanisms that take an amount of space that grows polynomially with the number of agents. The paper addresses this issue by proposing a compact encoding for representing and reasoning about the outcomes of NTU coalitional games founding on answer set programming. Computational issues arising in the setting have been studied too, by addressing questions related to certain payoff distributions enjoying desirable stability properties.
Keywords:
Answer set programming; Coalitional games; Computational complexity; Game theory

Contacts :
0