Conference item
Randomized assignments for barter exchanges: Fairness vs efficiency
- Abstract:
-
We study fairness and efficiency properties of randomized algorithms for barter exchanges with direct applications to kidney exchange problems. It is well documented that randomization can serve as a tool to ensure fairness among participants. However, in many applications, practical constraints often restrict the maximum allowed cyclelength of the exchange and for randomized algorithms, this imposes constraints of the cycle-length of every realized exchange in their decomposition. We prove t...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted manuscript
Actions
Access Document
- Files:
-
-
(pdf, 370.7KB)
-
- Publisher copy:
- 10.1007/978-3-319-23114-3_32
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Bibliographic Details
- Publisher:
- Springer International Publishing Switzerland Publisher's website
- Pages:
- 537-552
- Series:
- Lecture Notes in Computer Science
- Publication date:
- 2015-08-28
- DOI:
- ISSN:
-
0302-9743 and 1611-3349
- Pubs id:
-
pubs:578438
- URN:
-
uri:6ee83ebf-4b33-47cd-9ee5-47fd492d8682
- UUID:
-
uuid:6ee83ebf-4b33-47cd-9ee5-47fd492d8682
- Local pid:
- pubs:578438
- ISBN:
- 9783319231136
Item Description
- Keywords:
Terms of use
- Copyright holder:
- Springer International Publishing Switzerland
- Copyright date:
- 2015
- Notes:
-
This is an
accepted manuscript of a journal article published by Springer in ADT 2015: Algorithmic Decision Theory on 2015-08-28, available online: http://dx.doi.org/10.1007/978-3-319-23114-3_32
If you are the owner of this record, you can report an update to it here: Report update to this record