activity
20092018
most citedNegotiating Socially Optimal Allocations of Resources

125 citations · 216 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2018★ 2 cited

Lecture Notes on Fair Division

Ulle Endriss

Fair division is the problem of dividing one or several goods amongst two or more agents in a way that satisfies a suitable fairness criterion. These Notes provide a succinct intro…

cs.AI2017★ 3 cited

Preservation of Semantic Properties during the Aggregation of Abstract Argumentation Frameworks

Weiwei Chen, Ulle Endriss

An abstract argumentation framework can be used to model the argumentative stance of an agent at a high level of abstraction, by indicating for every pair of arguments that is bein…

cs.MA2014★ 86 cited

Complexity of Judgment Aggregation

Ulle Endriss, Umberto Grandi, Daniele Porello

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determinat…

cs.MA2011★ 125 cited

Negotiating Socially Optimal Allocations of Resources

U. Endriss, N. Maudet, F. Sadri +1

A multiagent system may be thought of as an artificial society of autonomous software agents and we can apply concepts borrowed from welfare economics and social choice theory to a…

cs.AI2009

The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

P. Mancarella, G. Terreni, F. Sadri +2

We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive lo…