Algorithmic Matching
Algorithmic Matching is a computational method within multi-sided market design that systematically pairs participants or resources across interdependent sides according to predefined rules or optimization criteria to achieve desired market outcomes.
108
Publications
8.5K
Citations
279
Authors
160
Institutions
Publications per year
2017–2026
51
Parents
108
AdWords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani et al. · Journal of the ACM · 2007 · 622 citations
1–5 of 108
279
4
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 279
160
Stanford University
Stanford, United States
10 h-index
12 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
9 publications
841 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
8 publications
287 citations
University of Southern California
Los Angeles, United States
5 h-index
12 publications
206 citations

University of Glasgow
Glasgow, United Kingdom
3 h-index
3 publications
444 citations
Yale University
New Haven, United States
3 h-index
3 publications
288 citations

Polytechnic University of Bari
Bari, Italy
3 h-index
12 publications
796 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
6 publications
422 citations
1–8 of 160
Repository · 6 publications · 78 citations
6
h-index
PVLDB · 3 publications · 121 citations
3
h-index
2 publications · 121 citations
2
h-index
2 publications · 47 citations
2
h-index
2 publications · 118 citations
2
h-index
1–5