Random assignment under ordinal preferences: a separation characterisation
by Ping Zhan
Asian J. of Management Science and Applications (AJMSA), Vol. 3, No. 1, 2017

Abstract: Assignment problems include allocating a set of objects among agents; here, only ordinal preferences are revealed. In this paper, we establish a condition of feasible solutions for deterministic assignments. Related to it, we show then a separation characterisation for probabilistic serial (PS) mechanism, based on sd-efficiency, sd-envy-freeness and the definition of PS (where 'sd' stands for first-order stochastic dominance). An application to recent result about PS is also described. Models here are suitable for assignment problems in various fields, such as fair sharing of resources in industry. The separation structure proposed here provides a possibility to divide a large-scale problem into several sub-problems.

Online publication date: Sat, 08-Apr-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the Asian J. of Management Science and Applications (AJMSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com