Conference item icon

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

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-23114-3_32

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author

Contributors

Role:
Editor
Publisher:
Springer International Publishing Switzerland Publisher's website
Journal:
ADT 2015: Algorithmic Decision Theory Journal website
Pages:
537-552
Series:
Lecture Notes in Computer Science
Host title:
ADT 2015: Algorithmic Decision Theory
Publication date:
2015-08-28
DOI:
ISSN:
0302-9743 and 1611-3349
ISBN:
9783319231136
Keywords:
Pubs id:
pubs:578438
UUID:
uuid:6ee83ebf-4b33-47cd-9ee5-47fd492d8682
Local pid:
pubs:578438
Deposit date:
2016-10-10

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP