Consistent bilateral assignment

Moulin, H. (2016) Consistent bilateral assignment. Mathematical Social Sciences, (doi:10.1016/j.mathsocsci.2016.09.004) (In Press)

[img] Text
124894.pdf - Accepted Version
Restricted to Repository staff only until 28 September 2017.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

508kB

Abstract

In the bilateral assignment problem, source a holds the amount ra of resource of type a, while sink i must receive the total amount xi of the various resources. We look for assignment rules meeting the powerful separability property known as Consistency: “every subassignment of a fair assignment is fair”. They are essentially those rules selecting the feasible flow minimizing the sum ∑i,aW(yia), where W is smooth and strictly convex.

Item Type:Articles
Status:In Press
Refereed:Yes
Glasgow Author(s) Enlighten ID:Moulin, Professor Herve
Authors: Moulin, H.
College/School:College of Social Sciences > Adam Smith Business School > Economics
Journal Name:Mathematical Social Sciences
Publisher:Elsevier
ISSN:0165-4896
ISSN (Online):1879-3118
Published Online:28 September 2016
Copyright Holders:Copyright © 2016 Elsevier B.V.
First Published:First published in Mathematical Social Sciences 2016
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record