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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
