S
Siddharth Barman
Researcher at Indian Institute of Science
Publications - 112
Citations - 1864
Siddharth Barman is an academic researcher from Indian Institute of Science. The author has contributed to research in topics: Fair division & Submodular set function. The author has an hindex of 21, co-authored 104 publications receiving 1488 citations. Previous affiliations of Siddharth Barman include University of Wisconsin-Madison & London School of Economics and Political Science.
Papers
More filters
Proceedings ArticleDOI
Finding Fair and Efficient Allocations
TL;DR: In this article, a pseudopolynomial time algorithm for finding allocations that are EF1 and Pareto efficient is presented. But this algorithm does not provide an efficient algorithm for maximizing Nash social welfare, which is NP-hard.
Proceedings ArticleDOI
Approximation Algorithms for Maximin Fair Division
TL;DR: This paper shows that when the valuations of the agents are nonnegative, monotone, and submodular, then a 1/10-approximate maximin fair allocation is guaranteed to exist and shows that such an allocation can be efficiently found by using a simple round-robin algorithm.
Posted Content
Decomposition Methods for Large Scale LP Decoding
TL;DR: This paper draws on decomposition methods from optimization theory, specifically the alternating direction method of multipliers (ADMM), to develop efficient distributed algorithms for LP decoding, and develops an efficient algorithm for Euclidean norm projection onto the parity polytope.
Journal ArticleDOI
Decomposition Methods for Large Scale LP Decoding
TL;DR: In this paper, a two-slice characterization of the parity polytope is presented, which simplifies the representation of points in the parity space and allows the decoding of large-scale error-correcting codes efficiently.
Proceedings ArticleDOI
Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem
TL;DR: This paper establishes that in a bimatrix game with n x n payoff matrices A, B, if the number of non-zero entries in any column of A+B is at most s then an ε-Nash equilibrium of the game can be computed in time nO(log s/ε2}).