Siddharth Barman

From MaRDI portal
Person:776233

Available identifiers

zbMath Open barman.siddharthMaRDI QIDQ776233

List of research outcomes





PublicationDate of PublicationType
Approximation algorithms for envy-free cake division with connected pieces2024-11-14Paper
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies2024-02-23Paper
Nash welfare guarantees for fair and efficient coverage2023-08-04Paper
Optimal bounds on the price of fairness for indivisible goods2023-03-21Paper
https://portal.mardi4nfdi.de/entity/Q58744772023-02-07Paper
Tight approximation bounds for maximum multi-coverage2022-10-14Paper
Fair Cake Division Under Monotone Likelihood Ratios2022-09-26Paper
Fully polynomial-time approximation schemes for fair rent division2022-09-26Paper
Approximating Nash social welfare under binary XOS and binary subadditive valuations2022-07-06Paper
Tight approximation bounds for maximum multi-coverage2022-03-22Paper
Fair and efficient cake division with connected pieces2020-06-30Paper
Fully polynomial-time approximation schemes for fair rent division2019-10-15Paper
Traffic-redundancy aware network design2019-05-10Paper
Packing multiway cuts in capacitated graphs2019-05-06Paper
Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem2018-07-04Paper
Algorithmic Aspects of Optimal Channel Coding2018-06-27Paper
Algorithmic aspects of private Bayesian persuasion2018-05-03Paper
Decomposition Methods for Large Scale LP Decoding2017-06-08Paper
Empirical distribution of equilibrium play and its testing application2017-04-13Paper
Network design with coverage costs2017-03-22Paper
Approximating Nash equilibria in tree polymatrix games2015-11-04Paper
Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem2015-08-21Paper
On the Existence of Low-Rank Explanations for Mixed Strategy Behavior2015-01-07Paper
Region growing for multi-route cuts2014-05-22Paper
Secretary problems with convex costs2013-08-12Paper
A bicriteria approximation for the reordering buffer problem2012-09-25Paper

Research outcomes over time

This page was built for person: Siddharth Barman