Proceedings of the 12th ACM Conference on Electronic Commerce 2011
DOI: 10.1145/1993574.1993626
|View full text |Cite
|
Sign up to set email alerts
|

A random graph model of kidney exchanges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
5
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 13 publications
1
5
0
Order By: Relevance
“…Our random model assures that this difference is small enough to avoid the need for such four-way exchanges (note from Figure 2 that such a four-way exchange becomes inefficient, since it uses an AB-O pair that could instead have been used in a three-way exchange and an A-B pair that could have been used in either a two-way or a three-way exchange, for a total of more than four transplants). Toulis and Parkes (2011) prove a similar result to ours.…”
Section: Either Every B-a Pair Is Matched In a Two-way Exchange With supporting
confidence: 87%
See 4 more Smart Citations
“…Our random model assures that this difference is small enough to avoid the need for such four-way exchanges (note from Figure 2 that such a four-way exchange becomes inefficient, since it uses an AB-O pair that could instead have been used in a three-way exchange and an A-B pair that could have been used in either a two-way or a three-way exchange, for a total of more than four transplants). Toulis and Parkes (2011) prove a similar result to ours.…”
Section: Either Every B-a Pair Is Matched In a Two-way Exchange With supporting
confidence: 87%
“…1. Toulis and Parkes (2011) show a similar result only under their assumption that each hospital has a canonical structure (see the first remark at the end of Section 6). Another important difference is that they do not allow hospitals to withhold a single pair (only internal allocations).…”
mentioning
confidence: 78%
See 3 more Smart Citations