| Ordinal maximin share approximation for goods H Hosseini, A Searns, E Segal-Halevi Journal of Artificial Intelligence Research 74, 353–391-353–391, 2022 | 16 | 2022 |
| Guaranteeing maximin shares: Some agents left behind H Hosseini, A Searns arXiv preprint arXiv:2105.09383, 2021 | 13 | 2021 |
| Ordinal maximin share approximation for chores H Hosseini, A Searns, E Segal-Halevi arXiv preprint arXiv:2201.07424, 2022 | 12 | 2022 |
| Fair division of time: Multi-layered cake cutting H Hosseini, A Igarashi, A Searns arXiv preprint arXiv:2004.13397, 2020 | 12 | 2020 |
| On counting oracles for path problems I Bezáková, A Searns 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018 | 11 | 2018 |
| Fairness does not imply satisfaction (student abstract) A Searns, H Hosseini Proceedings of the AAAI Conference on Artificial Intelligence 34 (10), 13911 …, 2020 | 4 | 2020 |
| Rethinking resource allocation: Fairness and computability A Searns Rochester Institute of Technology, 2020 | 3 | 2020 |
| Fairness Does Not Imply Satisfaction A Searns, H Hosseini | | 2020 |
| Neural Networks: Trade-offs of Depth and Width A Searns | | |
