Eklavya: Publications

1. Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets
   submitted to ITCS 2027
   with Bhaskar Ray Chaudhury, Jugal Garg, Jiaxin Song
   Topics: data economics
   arXiv:2602.13897
2. Equilibrium Pricing in Oligopolistic Data Markets
   in ICML 2026 (oral)
   with Bhaskar Ray Chaudhury, Jugal Garg, Jiaxin Song
   Topics: data economics, games
   arXiv:2608.14018, OpenReview:TAqejOfEAJ, Lean proof
3. Non-Linear Pricing Restores Tractability for a Data Seller
   submitted to NeurIPS 2026
   with Bhaskar Ray Chaudhury, Jugal Garg, Jiaxin Song
   Topics: data economics
4. Exploring Relations among Fairness Notions in Discrete Fair Division
   in AAMAS 2026
   with Jugal Garg
   Topics: fair allocation, automation
   arXiv:2502.02815, doi:10.65109/DRAH3963, interactive demo
5. Proportional and Pareto-Optimal Allocation of Chores with Subsidy
   in AAMAS 2026
   with Jugal Garg, Xiaowei Wu
   Topics: fair allocation
   arXiv:2510.10335, doi:10.65109/UYKY7130
6. Improving Approximation Guarantees for Maximin Share
   in EC 2024
   with Hannaneh Akrami, Jugal Garg, Setareh Taki
   Topics: fair allocation
   doi:10.1145/3670865.3673544, arXiv:2307.12916
7. Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
   with Jugal Garg
   Topics: fair allocation
   arXiv:2410.08986
8. New Fairness Concepts for Allocating Indivisible Items
   in IJCAI 2023
   with Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Giovanna Varricchio
   Topics: fair allocation
   arXiv:2206.01710, doi:10.24963/ijcai.2023/284, YouTube (1:10:00)
   These results were independently discovered by two research groups: UIUC and Aarhus. When we found out about each other, we merged our results into a single paper.
9. Simplification and Improvement of MMS Approximation
   in IJCAI 2023
   with Hannaneh Akrami, Jugal Garg, Setareh Taki
   Topics: fair allocation
   arXiv:2303.16788, doi:10.24963/ijcai.2023/276
10. Nash Equilibria of Two-Player Matrix Games Repeated Until Collision
    in FSTTCS 2023
    with Aniket Murhekar
    Topics: games
    arXiv:2309.15870, doi:10.4230/LIPIcs.FSTTCS.2023.18, YouTube (30:00)
11. Automating the Search for Small Hard Examples to Approximation Algorithms
    Topics: approximation algorithms, automation
    arXiv:2504.04738
12. Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
    in FSTTCS 2022
    with Arindam Khan, K. V. N. Sreenivas
    Topics: bin packing, geometry, approximation algorithms
    arXiv:2106.13951, doi:10.4230/LIPIcs.FSTTCS.2022.23, YouTube (20:00)
13. Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
    in APPROX 2021 and Algorithmica
    with Arindam Khan
    Topics: bin packing, geometry, approximation algorithms
    Journal version, conference version, arXiv:2105.02827, YouTube (20:00)
14. Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins
    in FSTTCS 2021
    Topics: bin packing, geometry, approximation algorithms
    doi:10.4230/LIPIcs.FSTTCS.2021.32, arXiv:2011.10963, YouTube (25:00)
15. Approximation Algorithms for Generalized Multidimensional Knapsack
    with Arindam Khan, K. V. N. Sreenivas
    Topics: bin packing, geometry, approximation algorithms
    arXiv:2102.05854
16. Approximation Algorithms for Geometric Packing Problems
    M.Tech. (Research) thesis at CSA, IISc
    advised by Prof. Arindam Khan
    Topics: bin packing, geometry, approximation algorithms
    pdf, etd@iisc
17. Mitigating DNS Amplification Attacks Using a Set of Geographically Distributed SDN Routers
    in ICACCI 2018
    with Vishal Gupta
    Topics: network security
    doi:10.1109/ICACCI.2018.8554459