Fair decomposition of group obligations

Alechina, Natasha and Hoek, Wiebe van der and Logan, Brian (2017) Fair decomposition of group obligations. Journal of Logic and Computation . ISSN 1465-363X

[img] PDF - Repository staff only until 24 March 2018. - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (377kB)

Abstract

We consider the problem of decomposing a group norm into a set of individual obligations for the agents comprising the group, such that if the individual obligations are fulfilled, the group obligation is fulfilled. Such an assignment of tasks to agents is often subject to additional social or organisational norms that specify permissible ways in which tasks can be assigned. An important role of social norms is that they can be used to impose ‘fairness constraints’, which seek to distribute individual responsibility for discharging the group norm in a ‘fair’ or ‘equitable’ way. We propose a simple language for this kind of fairness constraints and analyse the problem of computing a fair decomposition of a group obligation, both for non-repeating and for repeating group obligations.

Item Type: Article
Additional Information: This is a pre-copyedited, author-produced version of an article accepted for publication in Journal of Logic and Computation following peer review. The version of record Natasha Alechina, Wiebe van der Hoek, Brian Logan; Fair decomposition of group obligations. J Logic Computation 2017 exx012. doi: 10.1093/logcom/exx012 is available online at: https://doi.org/10.1093/logcom/exx012
Keywords: Multi-Agent Systems, Group obligations, Group norms, Effectiveness, Fairness, Minimality of norms
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1093/logcom/exx012
Depositing User: Eprints, Support
Date Deposited: 08 Mar 2017 13:48
Last Modified: 21 Jul 2017 14:01
URI: http://eprints.nottingham.ac.uk/id/eprint/41158

Actions (Archive Staff Only)

Edit View Edit View