Siddharth Barman

Debajyoti Kar

Shraddha Pathak

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Nearly Equitable Allocations beyond Additivity and Monotonicity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies.

[BibT_eX]

[DOI]

Federico Echenique

Math. Oper. Res., February, 2023

Nash Regret Guarantees for Linear Bandits.

[BibT_eX]

[DOI]

Ayush Sawarni

Soumybrata Pal

CoRR, 2023

Learning good interventions in causal graphs via covering.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2023

Guaranteeing Envy-Freeness under Generalized Assignment Constraints.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Nash Regret Guarantees for Linear Bandits.

[BibT_eX]

[DOI]

Ayush Sawarni

Soumyabrata Pal

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Algorithms for Envy-Free Cake Division with Connected Pieces.

[BibT_eX]

[DOI]

Pooja Kulkarni

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Fair Chore Division under Binary Supermodular Costs.

[BibT_eX]

[DOI]

Vishnu V. Narayan

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Finding Fair Allocations under Budget Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Tight approximation bounds for maximum multi-coverage.

[BibT_eX]

[DOI]

Math. Program., 2022

Fair Cake Division Under Monotone Likelihood Ratios.

[BibT_eX]

[DOI]

Eshwar Ram Arunachaleswaran

Math. Oper. Res., 2022

Fully Polynomial-Time Approximation Schemes for Fair Rent Division.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

Nash Welfare Guarantees for Fair and Efficient Coverage.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Truthful and Fair Mechanisms for Matroid-Rank Valuations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Universal and Tight Online Algorithms for Generalized-Mean Welfare.

[BibT_eX]

[DOI]

Arindam Khan

Arnab Maiti

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Intervention Efficient Algorithm for Two-Stage Causal MDPs.

[BibT_eX]

[DOI]

CoRR, 2021

Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Tight Approximation Guarantees for Concave Coverage Problems.

[BibT_eX]

[DOI]

Omar Fawzi

Paul Fermé

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Optimal Algorithms for Range Searching over Multi-Armed Bandits.

[BibT_eX]

[DOI]

Ramakrishnan Krishnamurthy

Saladi Rahul

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Approximation Algorithms for Maximin Fair Division.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2020

Settling the Price of Fairness for Indivisible Goods.

[BibT_eX]

[DOI]

Umang Bhaskar

Nisarg Shah

CoRR, 2020

Optimal Bounds on the Price of Fairness for Indivisible Goods.

[BibT_eX]

[DOI]

Umang Bhaskar

Nisarg Shah

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Uniform Welfare Guarantees Under Identical Subadditive Valuations.

[BibT_eX]

[DOI]

Eshwar Ram Arunachaleswaran

Ranjani G. Sundaram

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Quantifying Infra-Marginality and Its Trade-off with Group Fairness.

[BibT_eX]

[DOI]

CoRR, 2019

Fair and Efficient Cake Division with Connected Pieces.

[BibT_eX]

[DOI]

Rachitesh Kumar

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Fair Division of Indivisible Goods Among Strategic Agents.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Matroid Constrained Fair Allocation Problem.

[BibT_eX]

[DOI]

Arpita Biswas

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

On the Proximity of Markets with Integral Equilibria.

[BibT_eX]

[DOI]

Eshwar Ram Arunachaleswaran

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Fair Division with a Secretive Agent.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Algorithmic Aspects of Optimal Channel Coding.

[BibT_eX]

[DOI]

Omar Fawzi

IEEE Trans. Inf. Theory, 2018

Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Finding Fair and Efficient Allocations.

[BibT_eX]

[DOI]

Rohit Vaish

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Fair Division Under Cardinality Constraints.

[BibT_eX]

[DOI]

Arpita Biswas

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Testing Sparsity over Known and Unknown Bases.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Suprovat Ghoshal

Proceedings of the 35th International Conference on Machine Learning, 2018

Greedy Algorithms for Maximizing Nash Social Welfare.

[BibT_eX]

[DOI]

Rohit Vaish

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Online Learning for Structured Loss Spaces.

[BibT_eX]

[DOI]

Aditya Gopalan

Aadirupa Saha

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Groupwise Maximin Fair Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Sanath Kumar Krishna Murthy

Arpita Biswas

Yadati Narahari

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Empirical Distribution of Equilibrium Play and Its Testing Application.

[BibT_eX]

[DOI]

Ron Peretz

Math. Oper. Res., 2017

Algorithmic Aspects of Private Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

The Dictionary Testing Problem.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Suprovat Ghoshal

CoRR, 2016

Computational Aspects of Private Bayesian Persuasion.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Query Complexity of Correlated Equilibrium.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Finding any nontrivial coarse correlated equilibrium is hard.

[BibT_eX]

[DOI]

Katrina Ligett

SIGecom Exch., 2015

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions.

[BibT_eX]

[DOI]

Umang Bhaskar

Chaitanya Swamy

CoRR, 2015

Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Online Convex Optimization Using Predictions.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Approximating Nash Equilibria in Tree Polymatrix Games.

[BibT_eX]

[DOI]

Katrina Ligett

Georgios Piliouras

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

2014

Approximating Carathéodory's Theorem and Nash Equilibria.

[BibT_eX]

[DOI]

CoRR, 2014

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Simple approximate equilibria in large games.

[BibT_eX]

[DOI]

Ron Peretz

Proceedings of the ACM Conference on Economics and Computation, 2014

On Load Shedding in Complex Event Processing.

[BibT_eX]

[DOI]

Yeye He

Jeffrey F. Naughton

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Network Design with Coverage Costs.

[BibT_eX]

[DOI]

Seeun Umboh

Proceedings of the Approximation, 2014

2013

Decomposition Methods for Large Scale LP Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

A 2-Approximation for Redundancy Aware Network Design with Laminar Demands

[BibT_eX]

[DOI]

Seeun Umboh

CoRR, 2013

The Complexity of Nash Equilibria as Revealed by Data.

[BibT_eX]

[DOI]

CoRR, 2013

Small-Support Approximate Correlated Equilibria.

[BibT_eX]

[DOI]

Ron Peretz

CoRR, 2013

A tale of two metrics: simultaneous bounds on competitiveness and regret.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

The empirical implications of rank in Bimatrix games.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Traffic-redundancy aware network design.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach.

[BibT_eX]

[DOI]

Chong Sun

Jeffrey F. Naughton

Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

Secretary Problems with Convex Costs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Bicriteria Approximation for the Reordering Buffer Problem.

[BibT_eX]

[DOI]

Seeun Umboh

Proceedings of the Algorithms - ESA 2012, 2012

2011

On the complexity of privacy-preserving complex event processing.

[BibT_eX]

[DOI]

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Preventing equivalence attacks in updated, anonymized data.

[BibT_eX]

[DOI]

Yeye He

Jeffrey F. Naughton

Proceedings of the 27th International Conference on Data Engineering, 2011

2010

Region Growing for Multi-Route Cuts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Packing multiway cuts in capacitated graphs.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2005

Secure Two-Party Context Free Language Recognition.

[BibT_eX]

[DOI]

Anshuman Singh