NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (31)

cs.DS2011

Traffic-Redundancy Aware Network Design

Siddharth Barman, Shuchi Chawla

cs.IT2016

Algorithmic Aspects of Optimal Channel Coding

Siddharth Barman, Omar Fawzi

cs.GT2018

Finding Fair and Efficient Allocations

Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish

cs.GT2015

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

Siddharth Barman

cs.DB2013

On Load Shedding in Complex Event Processing

Yeye He, Siddharth Barman, Jeffrey F. Naughton

cs.GT2015

Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard

Siddharth Barman, Katrina Ligett

cs.GT2018

On the Proximity of Markets with Integral Equilibria

Siddharth Barman, Sanath Kumar Krishnamurthy

cs.GT2019

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

Siddharth Barman, Federico Echenique

cs.DS2009

Region growing for multi-route cuts

Siddharth Barman, Shuchi Chawla

cs.DS2017

Testing Sparsity over Known and Unknown Bases

Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal

cs.GT2017

Groupwise Maximin Fair Allocation of Indivisible Goods

Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy +1

cs.GT2019

Fair Division of Indivisible Goods Among Strategic Agents

Siddharth Barman, Ganesh Ghalme, Shweta Jain +2

cs.GT2016

Approximating Nash Equilibria in Tree Polymatrix Games

Siddharth Barman, Katrina Ligett, Georgios Piliouras

cs.GT2013

Small-Support Approximate Correlated Equilibria

Yakov Babichenko, Siddharth Barman, Ron Peretz

cs.GT2016

Computational Aspects of Private Bayesian Persuasion

Yakov Babichenko, Siddharth Barman

cs.DS2013

Network Design with Coverage Costs

Siddharth Barman, Shuchi Chawla, Seeun Umboh

cs.GT2018

Fully Polynomial-Time Approximation Schemes for Fair Rent Division

Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi

cs.DS2011

Secretary Problems with Convex Costs

Siddharth Barman, Seeun Umboh, Shuchi Chawla +1

cs.LG2015

Online Convex Optimization Using Predictions

Niangjun Chen, Anish Agarwal, Adam Wierman +2

cs.DS2015

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret

Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett +4

cs.GT2013

Query Complexity of Correlated Equilibrium

Yakov Babichenko, Siddharth Barman

cs.GT2013

The Empirical Implications of Rank in Bimatrix Games

Siddharth Barman, Umang Bhaskar, Federico Echenique +1

cs.DS2012

A Bicriteria Approximation for the Reordering Buffer Problem

Siddharth Barman, Shuchi Chawla, Seeun Umboh

cs.GT2018

Fair Division with a Secretive Agent

Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi

cs.GT2014

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

Siddharth Barman, Umang Bhaskar, Federico Echenique +1

cs.GT2018

Greedy Algorithms for Maximizing Nash Social Welfare

Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish

cs.GT2014

Empirical Distribution of Equilibrium Play and Its Testing Application

Yakov Babichenko, Siddharth Barman, Ron Peretz

cs.DS2008

Packing multiway cuts in capacitated graphs

Siddharth Barman, Shuchi Chawla

cs.GT2015

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions

Siddharth Barman, Umang Bhaskar, Chaitanya Swamy

cs.LG2017

Online Learning for Structured Loss Spaces

Siddharth Barman, Aditya Gopalan, Aadirupa Saha

cs.IT2013

Decomposition Methods for Large Scale LP Decoding

Siddharth Barman, Xishuo Liu, Stark C. Draper +1