| Competitive division of a mixed manna A Bogomolnaia, H Moulin, F Sandomirskiy, E Yanovskaya Econometrica 85 (6), 1847-1871, 2017 | 114 | 2017 |
| A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation H Aziz, H Moulin, F Sandomirskiy Operations Research Letters 48 (5), 573-578, 2020 | 80 | 2020 |
| Dividing bads under additive utilities A Bogomolnaia, H Moulin, F Sandomirskiy, E Yanovskaia Social Choice and Welfare 52 (3), 395-417, 2019 | 56 | 2019 |
| Algorithms for competitive division of chores S Brânzei, F Sandomirskiy arXiv preprint arXiv:1907.01766, 2019 | 34 | 2019 |
| Feasible joint posterior beliefs I Arieli, Y Babichenko, F Sandomirskiy, O Tamuz Journal of Political Economy 129 (9), 2546-2594, 2021 | 32 | 2021 |
| Fair division with minimal sharing F Sandomirskiy, E Segal-Halevi arXiv preprint arXiv:1908.01669, 105, 2019 | 32* | 2019 |
| Dividing goods or bads under additive utilities A Bogomolnaia, H Moulin, F Sandomirskiy, E Yanovskaya arXiv preprint arXiv:1608.01540, 2016 | 27 | 2016 |
| An exact renormalization formula for the Maryland model A Fedotov, F Sandomirskiy Communications in Mathematical Physics 334, 1083-1099, 2015 | 25 | 2015 |
| Protecting the protected group: Circumventing harmful fairness O Ben-Porat, F Sandomirskiy, M Tennenholtz Proceedings of the aaai conference on artificial intelligence 35 (6), 5176-5184, 2021 | 19 | 2021 |
| Private private information K He, F Sandomirskiy, O Tamuz arXiv preprint arXiv:2112.14356, 2021 | 18 | 2021 |
| Bayesian persuasion with mediators I Arieli, Y Babichenko, F Sandomirskiy arXiv preprint arXiv:2203.04285, 2022 | 17 | 2022 |
| Representative committees of peers R Meir, F Sandomirskiy, M Tennenholtz Journal of Artificial Intelligence Research 71, 401-429, 2021 | 15 | 2021 |
| On the fair division of a random object A Bogomolnaia, H Moulin, F Sandomirskiy Management Science 68 (2), 1174-1194, 2022 | 13 | 2022 |
| Persuasion as transportation I Arieli, Y Babichenko, F Sandomirskiy arXiv preprint arXiv:2307.07672, 2023 | 11 | 2023 |
| Beckmann's approach to multi-item multi-bidder auctions AV Kolesnikov, F Sandomirskiy, A Tsyvinski, AP Zimin arXiv preprint arXiv:2203.06837, 2022 | 11 | 2022 |
| A simple online fair division problem A Bogomolnaia, H Moulin, F Sandomirskiy arXiv preprint arXiv:1903.10361 1, 2019 | 8 | 2019 |
| Algorithms for competitive division of chores S Brânzei, F Sandomirskiy Mathematics of Operations Research 49 (1), 398-429, 2024 | 7 | 2024 |
| On social networks that support learning I Arieli, F Sandomirskiy, R Smorodinsky arXiv preprint arXiv:2011.05255, 2020 | 3 | 2020 |
| On repeated zero-sum games with incomplete information and asymptotically bounded values F Sandomirskiy Dynamic Games and Applications 8 (1), 180-198, 2018 | 3 | 2018 |
| Repeated games of incomplete information with large sets of states F Sandomirskiy International Journal of Game Theory 43, 767-789, 2014 | 3 | 2014 |
Herve MoulinUniversity of Glasgow在 glasgow.ac.uk 的电子邮件经过验证
