default search action
Nidhi Rathi
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Ioannis Caragiannis, Nidhi Rathi:
Optimizing Over Serial Dictatorships. Theory Comput. Syst. 68(5): 1180-1206 (2024) - [c8]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi:
On the Complexity of Pareto-Optimal and Envy-Free Lotteries. AAMAS 2024: 244-252 - [i13]Hannaneh Akrami, Nidhi Rathi:
Epistemic EFX Allocations Exist for Monotone Valuations. CoRR abs/2405.14463 (2024) - [i12]Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi:
Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity. CoRR abs/2407.04474 (2024) - [i11]Hannaneh Akrami, Nidhi Rathi:
Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously. CoRR abs/2409.01963 (2024) - [i10]Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi:
Fair Division in a Variable Setting. CoRR abs/2410.14421 (2024) - [i9]Mahyar Afshinmehr, Alireza Danaei, Mehrafarin Kazemi, Kurt Mehlhorn, Nidhi Rathi:
EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture. CoRR abs/2410.17002 (2024) - 2023
- [c7]Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio:
New Fairness Concepts for Allocating Indivisible Items. IJCAI 2023: 2554-2562 - [c6]Ioannis Caragiannis, Nidhi Rathi:
Optimizing over Serial Dictatorships. SAGT 2023: 329-346 - [c5]Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi:
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. WINE 2023: 310-328 - [i8]Mikael Høgsgaard, Panagiotis Karras, Wenyue Ma, Nidhi Rathi, Chris Schwiegelshohn:
Optimally Interpolating between Ex-Ante Fairness and Welfare. CoRR abs/2302.03071 (2023) - [i7]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi:
On the complexity of Pareto-optimal and envy-free lotteries. CoRR abs/2307.12605 (2023) - 2022
- [j2]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. Math. Oper. Res. 47(3): 1875-1903 (2022) - [j1]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. 47(3): 1970-1998 (2022) - [i6]Ioannis Caragiannis, Nidhi Rathi:
Optimizing over Serial Dictatorships. CoRR abs/2202.08097 (2022) - [i5]Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi:
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. CoRR abs/2211.06458 (2022) - 2020
- [c4]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. EC 2020: 401-437 - [i4]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. CoRR abs/2006.00481 (2020)
2010 – 2019
- 2019
- [c3]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. AAAI 2019: 1732-1739 - [c2]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. SODA 2019: 1994-2013 - [c1]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. WINE 2019: 57-70 - [i3]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. CoRR abs/1907.11019 (2019) - 2018
- [i2]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. CoRR abs/1807.04163 (2018) - [i1]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. CoRR abs/1811.10859 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint