when you care about fairness, representation, collective decision making, and incentives
This focus area studies algorithmic and computational aspects of combining individual preferences and interests into collective decisions. It encompassed coalition formation, preference aggregation, ranking systems, resource allocation, and voting.
@article{LiuLSW24,author={Liu, Shengxin and Lu, Xinhang and Suzuki, Mashbat and Walsh, Toby},title={Mixed Fair Division: {A} Survey},journal={Journal of Artificial Intelligence Research},volume={80},pages={1373--1406},year={2024},url={https://doi.org/10.1613/jair.1.15800},doi={10.1613/JAIR.1.15800}}
@inproceedings{SuzukiV24,author={Suzuki, Mashbat and Vollen, Jeremy},editor={Bergemann, Dirk and Kleinberg, Robert and Sab{\'{a}}n, Daniela},title={Maximum Flow is Fair: {A} Network Flow Approach to Committee Voting},booktitle={Proceedings of the 25th {ACM} Conference on Economics and Computation,
{EC} 2024, New Haven, CT, USA, July 8-11, 2024},pages={964--983},publisher={{ACM}},year={2024},url={https://doi.org/10.1145/3670865.3673603},doi={10.1145/3670865.3673603}}
ITCS
Siddharth Barman, Anand Krishna, Pooja Kulkarni, and Shivika Narang
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
In 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, 2024
@inproceedings{BarmanKKN24,author={Barman, Siddharth and Krishna, Anand and Kulkarni, Pooja and Narang, Shivika},editor={Guruswami, Venkatesan},title={Sublinear Approximation Algorithm for Nash Social Welfare with {XOS}
Valuations},booktitle={15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},series={LIPIcs},volume={287},pages={8:1--8:23},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2024},url={https://doi.org/10.4230/LIPIcs.ITCS.2024.8},doi={10.4230/LIPICS.ITCS.2024.8}}
Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism
In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022, 2022
@inproceedings{ALSW22,author={Aziz, Haris and Lam, Alexander and Suzuki, Mashbat and Walsh, Toby},editor={Koyejo, Sanmi and Mohamed, S. and Agarwal, A. and Belgrave, Danielle and Cho, K. and Oh, A.},title={Random Rank: The One and Only Strategyproof and Proportionally Fair
Randomized Facility Location Mechanism},booktitle={Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},year={2022},url={http://papers.nips.cc/paper\_files/paper/2022/hash/bac4d92b3f6decfe47eab9a5893dd1f6-Abstract-Conference.html}}
@article{LiYKJIKJ19,author={Li, Kai and Yuen, Chau and Kusy, Branislav and Jurdak, Raja and Ignjatovic, Aleksandar and Kanhere, Salil S. and Jha, Sanjay},title={Fair Scheduling for Data Collection in Mobile Sensor Networks with
Energy Harvesting},journal={{IEEE} Transactions on Mobile Computing},volume={18},number={6},pages={1274--1287},year={2019},url={https://doi.org/10.1109/TMC.2018.2861384},doi={10.1109/TMC.2018.2861384}}
@inproceedings{AzizM16,author={Aziz, Haris and Mackenzie, Simon},editor={Dinur, Irit},title={A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number
of Agents},booktitle={{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},pages={416--427},publisher={{IEEE} Computer Society},year={2016},url={https://doi.org/10.1109/FOCS.2016.52},doi={10.1109/FOCS.2016.52}}