Siddharth Barman

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 90

Top Venues

CoRR

AAAI

WINE

Publications

Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne
Nearly Equitable Allocations beyond Additivity and Monotonicity. AAAI (2024)
Ayush Sawarni, Nirjhar Das, Siddharth Barman, Gaurav Sinha
Optimal Regret with Limited Adaptivity for Generalized Linear Contextual Bandits. CoRR (2024)
Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS (2024)
Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman
Causal Contextual Bandits with Adaptive Context. CoRR (2024)
Siddharth Barman, Debajyoti Kar, Shraddha Pathak
Parameterized Guarantees for Almost Envy-Free Allocations. AAMAS (2024)
Siddharth Barman, Mashbat Suzuki
Compatibility of Fairness and Nash Welfare under Subadditive Valuations. CoRR (2024)
Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman
Learning Good Interventions in Causal Graphs via Covering. CoRR (2023)
Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
Fair Chore Division under Binary Supermodular Costs. CoRR (2023)
Ayush Sawarni, Soumyabrata Pal, Siddharth Barman
Nash Regret Guarantees for Linear Bandits. NeurIPS (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC (2023)
Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
Fair Chore Division under Binary Supermodular Costs. AAMAS (2023)
Ayush Sawarni, Soumybrata Pal, Siddharth Barman
Nash Regret Guarantees for Linear Bandits. CoRR (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. AAAI (2023)
Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman
Learning good interventions in causal graphs via covering. UAI (2023)
Siddharth Barman, Pooja Kulkarni
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. ICALP (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR (2023)
Siddharth Barman, Debajyoti Kar, Shraddha Pathak
Parameterized Guarantees for Almost Envy-Free Allocations. CoRR (2023)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI (2023)
Siddharth Barman, Federico Echenique
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. Math. Oper. Res. 48 (1) (2023)
Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne
Nearly Equitable Allocations Beyond Additivity and Monotonicity. CoRR (2023)
Siddharth Barman, Paritosh Verma
Truthful and Fair Mechanisms for Matroid-Rank Valuations. AAAI (2022)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. 47 (3) (2022)
Siddharth Barman, Nidhi Rathi
Fair Cake Division Under Monotone Likelihood Ratios. Math. Oper. Res. 47 (3) (2022)
Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. CoRR (2022)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. CoRR (2022)
Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
Tight approximation bounds for maximum multi-coverage. Math. Program. 192 (1) (2022)
Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
Nash Welfare Guarantees for Fair and Efficient Coverage. WINE (2022)
Siddharth Barman, Pooja Kulkarni
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. CoRR (2022)
Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
Nash Welfare Guarantees for Fair and Efficient Coverage. CoRR (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI (2022)
Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukhan
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. IJCAI (2022)
Siddharth Barman, Paritosh Verma
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations. CoRR (2021)
Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman
Intervention Efficient Algorithm for Two-Stage Causal MDPs. CoRR (2021)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR (2021)
Siddharth Barman, Omar Fawzi, Paul Fermé
Tight Approximation Guarantees for Concave Coverage Problems. STACS (2021)
Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul
Optimal Algorithms for Range Searching over Multi-Armed Bandits. CoRR (2021)
Siddharth Barman, Paritosh Verma
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. AAMAS (2021)
Siddharth Barman, Paritosh Verma
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. WINE (2021)
Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR (2021)
Siddharth Barman, Paritosh Verma
Truthful and Fair Mechanisms for Matroid-Rank Valuations. CoRR (2021)
Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul
Optimal Algorithms for Range Searching over Multi-Armed Bandits. IJCAI (2021)
Siddharth Barman, Ranjani G. Sundaram
Uniform Welfare Guarantees Under Identical Subadditive Valuations. CoRR (2020)
Siddharth Barman, Umang Bhaskar, Nisarg Shah
Optimal Bounds on the Price of Fairness for Indivisible Goods. WINE (2020)
Siddharth Barman, Umang Bhaskar, Nisarg Shah
Settling the Price of Fairness for Indivisible Goods. CoRR (2020)
Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
Tight Approximation Bounds for Maximum Multi-coverage. IPCO (2020)
Siddharth Barman, Omar Fawzi, Paul Fermé
Tight Approximation Guarantees for Concave Coverage Problems. CoRR (2020)
Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ESA (2020)
Siddharth Barman, Paritosh Verma
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. CoRR (2020)
Siddharth Barman, Sanath Kumar Krishnamurthy
Approximation Algorithms for Maximin Fair Division. ACM Trans. Economics and Comput. 8 (1) (2020)
Siddharth Barman, Federico Echenique
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. EC (2020)
Siddharth Barman, Nidhi Rathi
Fair Cake Division Under Monotone Likelihood Ratios. CoRR (2020)
Siddharth Barman, Ranjani G. Sundaram
Uniform Welfare Guarantees Under Identical Subadditive Valuations. IJCAI (2020)
Siddharth Barman, Nidhi Rathi
Fair Cake Division Under Monotone Likelihood Ratios. EC (2020)
Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. CoRR (2020)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi
Fair and Efficient Cake Division with Connected Pieces. WINE (2019)
Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
Tight Approximation Bounds for Maximum Multi-Coverage. CoRR (2019)
Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang
Fair Division of Indivisible Goods Among Strategic Agents. CoRR (2019)
Siddharth Barman, Sanath Kumar Krishnamurthy
On the Proximity of Markets with Integral Equilibria. AAAI (2019)
Siddharth Barman, Federico Echenique
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. CoRR (2019)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi
Fair and Efficient Cake Division with Connected Pieces. CoRR (2019)
Arpita Biswas, Siddharth Barman, Amit Deshpande, Amit Sharma
Quantifying Infra-Marginality and Its Trade-off with Group Fairness. CoRR (2019)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
Fair Division with a Secretive Agent. AAAI (2019)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. SODA (2019)
Arpita Biswas, Siddharth Barman
Matroid Constrained Fair Allocation Problem. AAAI (2019)
Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang
Fair Division of Indivisible Goods Among Strategic Agents. AAMAS (2019)
Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
Finding Fair and Efficient Allocations. EC (2018)
Arpita Biswas, Siddharth Barman
Fair Division Under Cardinality Constraints. IJCAI (2018)
Siddharth Barman, Arpita Biswas
Fair Division Under Cardinality Constraints. CoRR (2018)
Siddharth Barman, Aditya Gopalan, Aadirupa Saha
Online Learning for Structured Loss Spaces. AAAI (2018)
Siddharth Barman
Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem. SIAM J. Comput. 47 (3) (2018)
Siddharth Barman, Omar Fawzi
Algorithmic Aspects of Optimal Channel Coding. IEEE Trans. Inf. Theory 64 (2) (2018)
Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
Greedy Algorithms for Maximizing Nash Social Welfare. AAMAS (2018)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
Fair Division with a Secretive Agent. CoRR (2018)
Siddharth Barman, Sanath Kumar Krishnamurthy
On the Proximity of Markets with Integral Equilibria. CoRR (2018)
Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal
Testing Sparsity over Known and Unknown Bases. ICML (2018)
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. CoRR (2018)
Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
Greedy Algorithms for Maximizing Nash Social Welfare. CoRR (2018)
Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Yadati Narahari
Groupwise Maximin Fair Allocation of Indivisible Goods. AAAI (2018)
Yakov Babichenko, Siddharth Barman
Algorithmic Aspects of Private Bayesian Persuasion. ITCS (2017)
Siddharth Barman, Aditya Gopalan, Aadirupa Saha
Online Learning for Structured Loss Spaces. CoRR (2017)
Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
Finding Fair and Efficient Allocations. CoRR (2017)
Siddharth Barman, Sanath Kumar Krishna Murthy
Approximation Algorithms for Maximin Fair Division. CoRR (2017)
Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Y. Narahari
Groupwise Maximin Fair Allocation of Indivisible Goods. CoRR (2017)
Yakov Babichenko, Siddharth Barman, Ron Peretz
Empirical Distribution of Equilibrium Play and Its Testing Application. Math. Oper. Res. 42 (1) (2017)
Siddharth Barman, Sanath Kumar Krishna Murthy
Approximation Algorithms for Maximin Fair Division. EC (2017)
Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal
The Dictionary Testing Problem. CoRR (2016)
Siddharth Barman, Omar Fawzi
Algorithmic aspects of optimal channel coding. ISIT (2016)
Yakov Babichenko, Siddharth Barman
Computational Aspects of Private Bayesian Persuasion. CoRR (2016)
Siddharth Barman, Katrina Ligett, Georgios Piliouras
Approximating Nash Equilibria in Tree Polymatrix Games. CoRR (2016)
Siddharth Barman, Katrina Ligett
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. CoRR (2015)
Siddharth Barman, Omar Fawzi
Algorithmic Aspects of Optimal Channel Coding. CoRR (2015)
Siddharth Barman, Katrina Ligett
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. EC (2015)
Siddharth Barman, Katrina Ligett, Georgios Piliouras
Approximating Nash Equilibria in Tree Polymatrix Games. SAGT (2015)
Siddharth Barman, Katrina Ligett
Finding any nontrivial coarse correlated equilibrium is hard. SIGecom Exch. 14 (1) (2015)
Siddharth Barman, Umang Bhaskar, Chaitanya Swamy
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR (2015)
Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. CoRR (2015)
Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew
Online Convex Optimization Using Predictions. SIGMETRICS (2015)
Yakov Babichenko, Siddharth Barman
Query Complexity of Correlated Equilibrium. ACM Trans. Economics and Comput. 3 (4) (2015)
Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew
Online Convex Optimization Using Predictions. CoRR (2015)

Siddharth Barman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Siddharth Barman