1) Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity  [arXiv]

      with Ioannis Caragiannis and Kurt Mehlhorn

2) Epistemic EFX Allocations Exist for Monotone Valuations  [arXiv]

     with Hannaneh Akrami

3) Optimally Interpolating Between Fairness and Welfare for Allocation Problems [arXiv]

     with Mikael Møller Høsegaard, Panagiotis Karras, Chris Schweigelshohn, and Wenyue Ma

4) On the Complexity of Pareto-Optimal and Envy-Free Lotteries  (AAMAS'24) [arXiv]

     with Ioannis Caragiannis and Kristoffer Arnsfelt Hansen  

5) A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees  (WINE'23) [arXiv]

     with Ganesh Ghalme, Xin Huang, and Yuka Machino   

6) New Fairness Concepts for Allocating Indivisible Items  (IJCAI'23)   [arXiv]

     with Ioannis Caragiannis, Jugal Garg, Eklavya Sharma, and Giovanna Varricchio

7) Optimizing over Serial Dictatorships  (SAGT'23) [arXiv]

      with Ioannis Caragiannis

8) Fair Cake Division Under Monotone Likelihood Ratios  (EC'20)  (held virtually)

      with Siddharth Barman 

9) Fully Polynomial-Time Approximation Schemes for Fair Rent Division  (SODA'19)  (Slides)  (San Diego, USA)

      with Siddharth Barman and Eshwar Ram Arunachaleswaran

10) Fair Division with a Secretive Agent  (AAAI'19)  (Slides)  (Honululu, Hawaii, USA)

      with Siddharth Barman and Eshwar Ram Arunachaleswaran

11) Fair and Efficient Cake Division with Connected Pieces (WINE'19) (Held at Columbia University, New York, USA)

      with Siddharth Barman, Eshwar Ram Arunachaleswaran and Rachitesh Kumar  

12) Fair Cake Division Under Monotone Likelihood Ratios - Mathematics of Operations Research 

     Volume 47(3):1875-1903 (MOR'22)  with Siddharth Barman 

13) Fully Polynomial-Time Approximation Schemes for Fair Rent Division - Mathematics of Operations Research

      Volume 47(3):1970-1998 (MOR'22) with Siddharth Barman and Eshwar Ram Arunachaleswaran