Nidhi Rathi

Orcid: 0000-0001-8512-0885

According to our database1, Nidhi Rathi authored at least 15 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Achieving EF1 and Epistemic EFX Guarantees Simultaneously.
CoRR, February, 2026

2025
Fair Division in a Variable Setting.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

Epistemic EFX Allocations Exist for Monotone Valuations.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
On the Complexity of Pareto-Optimal and Envy-Free Lotteries.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Optimally Interpolating between Ex-Ante Fairness and Welfare.
CoRR, 2023

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Optimizing over Serial Dictatorships.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

New Fairness Concepts for Allocating Indivisible Items.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2020
Fair Cake Division Under Monotone Likelihood Ratios.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
Fair and Efficient Cake Division with Connected Pieces.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Fully Polynomial-Time Approximation Schemes for Fair Rent Division.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Fair Division with a Secretive Agent.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019


  Loading...