1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.GT2019
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies
Siddharth Barman, Federico Echenique
We revisit the connection between bargaining and equilibrium in exchange economies, and study its algorithmic implications. We consider bargaining outcomes to be allocations that c…
cs.GT2014
Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
Siddharth Barman
We present algorithmic applications of an approximate version of Carathéodory's theorem. The theorem states that given a set of vectors in , for every vector in t…
cs.DS2012★ 1 cited
A Bicriteria Approximation for the Reordering Buffer Problem
Siddharth Barman, Shuchi Chawla, Seeun Umboh
In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding…