{"type":"ScholarlyArticle","title":"Fairness and Optimization in Dynamic Multiagent Allocation Problems","authors":[{"name":"Yohai Trabelsi","slug":"yohai-trabelsi","given":"Yohai","family":"Trabelsi","affiliation":"Department of Computer Science , Bar-Ilan University , Ramat Gan , Israel"}],"abstract":"In many allocation problems, understanding individual agents' needs, wants, and tradeoffs is crucial for providing fair and efficient solutions. This paper begins with motivating applications and critical definitions. We review existing results, such as advising agents on relaxing restrictions for improved resource allocation, optimizing task allocation in online settings without rejection of a task, and more. We conclude by outlining three potential directions for future research.","doi":"10.24963/ijcai.2024/973","url":"https://ijcai.org/proceedings/2024/973","pdf":"https://ijcai.org/proceedings/2024/0973.pdf","markdown":"https://ijcai.org/proceedings/2024/973.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/973","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":973,"pages":{"first":8516,"last":8517},"keywords":["DC: Agent-based and Multi-agent Systems"],"videos":[],"references":[{"position":1,"raw":"[Ackerman Viden et al., 2023] O. Ackerman Viden, Y. Tra- belsi, P. Xu, K. A. Sankararaman, O. Maksimov, and S. Kraus. Allocation problem in remote teleoperation: On- line matching with offline reusable resources and delayed assignments. In AAMAS, pages 513-521, 2023.","title":"Allocation problem in remote teleoperation: Online matching with offline reusable resources and delayed assignments","authors":"O Ackerman Viden, Y Trabelsi, P Xu, K A Sankararaman, O Maksimov, S Kraus","year":"2023","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Adiga et al., 2024] A. Adiga, Y. Trabelsi, T. Ferdousi, M. Marathe, S. S. Ravi, S. Swarup, A. K. Vullikanti, M. Wilson, S. Kraus, R. Basu, S. Savalkar, M. Yourek, M. Brady, K. Rajagopalan, and J. Yoder. Value-based re- source matching with fairness criteria: Application to agri- cultural water trading. In AAMAS, 2024. To appear.","title":"Value-based resource matching with fairness criteria: Application to agricultural water trading","authors":"A Adiga, Y Trabelsi, T Ferdousi, M Marathe, S S Ravi, S Swarup, A K Vullikanti, M Wilson, S Kraus, R Basu, S Savalkar, M Yourek, M Brady, K Rajagopalan, J Yoder","year":"2024","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cai and Khan, 2010] H. Cai and S. Khan. The common first year studio in a hot-desking age: An explorative study on the studio environment and learning. Journal for Educa- tion in the Built Environment, 5(2):39-64, 2010.","title":"The common first year studio in a hot-desking age: An explorative study on the studio environment and learning","authors":"H Cai, S Khan","year":"2010","venue":"Journal for Education in the Built Environment","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Phillips et al., 2015] A. E. Phillips, H. Waterer, M. Ehrgott, and D. M. Ryan. Integer programming methods for large- scale practical classroom assignment problems. Comput- ers & Operations Research, 53:42-53, 2015.","title":"Integer programming methods for largescale practical classroom assignment problems","authors":"A E Phillips, H Waterer, M Ehrgott, D M Ryan","year":"2015","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Roth, 1986] A. E. Roth. On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica: Journal of the Econometric Soci- ety, 54(2):425-427, 1986.","title":"On the allocation of residents to rural hospitals: a general property of two-sided matching markets","authors":"A E Roth","year":"1986","venue":"Econometrica: Journal of the Econometric Society","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Trabelsi et al., 2022] Y. Trabelsi, A. Adiga, S. Kraus, and S. S. Ravi. Resource allocation to agents with restric- tions: Maximizing likelihood with minimum compromise. In EUMAS, pages 403-420, 2022.","title":"Resource allocation to agents with restrictions: Maximizing likelihood with minimum compromise","authors":"Y Trabelsi, A Adiga, S Kraus, S S Ravi","year":"2022","venue":"EUMAS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Trabelsi et al., 2023] Y. Trabelsi, A. Adiga, S. Kraus, S. S. Ravi, and D. J. Rosenkrantz. Resource sharing through multi-round matchings. In AAAI, pages 11681-11690, 2023.","title":"Resource sharing through multi-round matchings","authors":"Y Trabelsi, A Adiga, S Kraus, S S Ravi, D J Rosenkrantz","year":"2023","venue":"AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}