Symposium on Simplicity in Algorithms (SOSA) 2022
DOI: 10.1137/1.9781611977066.19
|View full text |Cite
|
Sign up to set email alerts
|

The Short-Side Advantage in Random Matching Markets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…For Delete, the effect was strongest, as deleting a single agent leads to an average normalized symmetric difference of 0.38. For Delete, Ashlagi, Kanoria, and Leshno (2017), Cai and Thomas (2021), Knuth, Motwani, and Pittel (1990) and Pittel (1989) offer some theoretical intuition of this phenomenon: Assuming that agents have random preferences (as in our experiments), with high probability in a men-optimal matching the average rank that a man has for the woman matched to him is log(n) (Knuth, Motwani, and Pittel 1990;Pittel 1989), whereas in an instance with n men and n − 1 women the average rank a man has for the woman matched to him is n 3 log(n) (Ashlagi, Kanoria, and Leshno 2017;Cai and Thomas 2021). Thus, if we delete a single woman from the instance (which happens with 50% probability when we delete a single agent), then already only to realize these average ranks, the given matching needs to be fundamentally restructured.…”
mentioning
confidence: 99%
“…For Delete, the effect was strongest, as deleting a single agent leads to an average normalized symmetric difference of 0.38. For Delete, Ashlagi, Kanoria, and Leshno (2017), Cai and Thomas (2021), Knuth, Motwani, and Pittel (1990) and Pittel (1989) offer some theoretical intuition of this phenomenon: Assuming that agents have random preferences (as in our experiments), with high probability in a men-optimal matching the average rank that a man has for the woman matched to him is log(n) (Knuth, Motwani, and Pittel 1990;Pittel 1989), whereas in an instance with n men and n − 1 women the average rank a man has for the woman matched to him is n 3 log(n) (Ashlagi, Kanoria, and Leshno 2017;Cai and Thomas 2021). Thus, if we delete a single woman from the instance (which happens with 50% probability when we delete a single agent), then already only to realize these average ranks, the given matching needs to be fundamentally restructured.…”
mentioning
confidence: 99%