|
 | Up a level |
Barman, S and Bhaskar, U and Pandit, Y and Pyne, S (2024) Nearly Equitable Allocations beyond Additivity and Monotonicity. In: 38th AAAI Conference on Artificial Intelligence, AAAI 2024, 20 February 2024through 27 February 2024, Vancouver, pp. 9494-9501.
Barman, S and Kar, D and Pathak, S (2024) Parameterized Guarantees for Almost Envy-Free Allocations. In: AAMAS 2024, 6 May 2024through 10 May 2024, Auckland, New Zealand, pp. 151-159.
Barman, S and Krishna, A and Kulkarni, P and Narang, S (2024) Sublinear approximation algorithm for nash social welfare with XOS valuations. In: UNSPECIFIED.
Barman, S and Kulkarni, P (2023) Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.
Sawarni, A and Madhavan, R and Sinha, G and Barman, S (2023) Learning Good Interventions in Causal Graphs via Covering. In: 39th Conference on Uncertainty in Artificial Intelligence, UAI 2023, 31 July - 4 August 2023, Pittsburgh, pp. 1827-1836.
Barman, S and Echenique, F (2023) The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. In: Mathematics of Operations Research, 48 (1). pp. 313-331.
Sawarni, A and Pal, S and Barman, S (2023) Nash Regret Guarantees for Linear Bandits. In: 37th Conference on Neural Information Processing Systems, NeurIPS 2023, 10 December 2023 through 16 December 2023, New Orleans.
Barman, S and Krishna, A and Narahari, Y and Sadhukhan, S (2022) Nash Welfare Guarantees for Fair and Efficient Coverage. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2 - 15 December 2022, Troy, pp. 256-272.
Barman, S and Krishna, A and Narahari, Y and Sadhukan, S (2022) Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. In: 31st International Joint Conference on Artificial Intelligence, IJCAI 2022, 23 - 29 July 2022, Vienna, pp. 60-66.
Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2022) Tight approximation bounds for maximum multi-coverage. In: Mathematical Programming, 192 (1-2). pp. 443-476.
Barman, S and Verma, P (2022) Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. In: 17th International Conference on Web and Internet Economics, WINE 2021, 14 - 17 December 2021, Virtual, Online, pp. 373-390.
Barman, S and Krishnamurthy, R and Rahul, S (2021) Optimal Algorithms for Range Searching over Multi-Armed Bandits. In: 30th International Joint Conference on Artificial Intelligence, IJCAI 2021, 19-27 Aug 2021, Virtual, Online, pp. 2177-2183.
Maity, T and Jain, S and Solra, M and Barman, S and Rana, S (2021) Robust and Reusable Laccase Mimetic Copper Oxide Nanozyme for Phenolic Oxidation and Biosensing. In: ACS Sustainable Chemistry and Engineering .
Barman, S and Bhaskar, U and Shah, N (2020) Optimal Bounds on the Price of Fairness for Indivisible Goods. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7-11 December 2020, Beijing; China, pp. 356-369.
Barman, S and Bhaskar, U and Krishna, A and Sundaram, RG (2020) Tight approximation algorithms for p-mean welfare under subadditive valuations. In: Leibniz International Proceedings in Informatics, LIPIcs, 7- 9 September 2020, Virtual, Pisa.
Barman, S and Echenique, F (2020) The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. In: 21st ACM Conference on Economics and Computation, EC 2020, 13 - 17, July 2020, Hungary, pp. 765-766.
Barman, S and Rathi, N (2020) Fair Cake Division under Monotone Likelihood Ratios. In: 21st ACM Conference on Economics and Computation, EC 2020, 13-17, July 2020, Hungary, pp. 401-437.
Barman, S and Krishnamurthy, SK (2020) Approximation Algorithms for Maximin Fair Division. In: ACM Transactions on Economics and Computation, 8 (1).
Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2020) Tight Approximation Bounds for Maximum Multi-coverage. In: 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, 8-10 Jun 2020, London, pp. 66-77.
Arunachaleswaran, ER and Barman, S and Kumar, R and Rathi, N (2019) Fair and Efficient Cake Division with Connected Pieces. In: 15th Conference on Web and Internet Economics, WINE 2019, 10 - 12 December 2019, New York City, pp. 57-70.
Barman, S and Ghalme, G and Jain, S and Kulkarni, P and Narang, S (2019) Fair division of indivisible goods among strategic agents. In: 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019, 13 - 17 May 2019, Montreal, pp. 1811-1813.
Biswas, A and Barman, S (2019) Matroid constrained fair allocation problem. In: 33rd AAAI Conference on Artificial Intelligence, 27 January - 1 February 2019, Honolulu, pp. 9921-9922.
Barman, S and Bhattacharyya, A and Ghoshal, S (2018) Testing sparsity over known and unknown bases. In: 35th International Conference on Machine Learning, ICML 2018, 10 - 15 July 2018, Stockholm, pp. 819-843.
Barman, S and Gopalan, A and Saha, A (2018) Online learning for structured loss spaces. In: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, 2 - 7 February 2018, New Orleans, pp. 2696-2703.
Babichenko, Y and Barman, S (2017) Algorithmic aspects of private Bayesian persuasion. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, 9 - 11 January 2017, Berkeley.
