Name: Hana Salavcová
Email: salavcovah@gmail.com
Project Title: Fair Allocation with Indivisible but Shareable Goods
Mentor: Arpita Biswas
Collaborator: Martin Černý
Office: CoRE 419
Host Institution: Rutgers University – Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Home Institution: Charles University, Faculty of Mathematics and Physics
I am a third-year undergraduate student in Computer Science at Charles University in Prague, with a strong interest in theoretical computer science and applied mathematics. I am currently participating in a summer DIMACS REU research program in the United States.
Title: Fair Allocation with Indivisible but Shareable Goods
This project explores fairness in algorithmic game theory for settings with indivisible goods. We focus on a mild relaxation of indivisibility by allowing limited sharing of items among agents. Our goal is to revisit classical fairness notions under this new model, understand which of them can still be guaranteed, and investigate suitable algorithms and approximation techniques for computing fair allocations.
Here is a list of papers I plan to read during the following weeks, related to our research direction:
I gratefully acknowledge the guidance of my supervisor Arpita Biswas throughout the course of this project.
I would also like to thank the DIMACS REU 2025 program for providing me with this incredible research opportunity. I am especially grateful to Rutgers University and the DIMACS center for hosting the program and creating a stimulating and supportive research environment.
This work is also partially supported by: