The following pages link to Siddharth Barman (Q776233):
Displaying 25 items.
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Optimal bounds on the price of fairness for indivisible goods (Q2692295) (← links)
- Secretary Problems with Convex Costs (Q2843237) (← links)
- A Bicriteria Approximation for the Reordering Buffer Problem (Q2912837) (← links)
- On the Existence of Low-Rank Explanations for Mixed Strategy Behavior (Q2937008) (← links)
- Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem (Q2941526) (← links)
- Network Design with Coverage Costs (Q2969041) (← links)
- Empirical Distribution of Equilibrium Play and Its Testing Application (Q2976138) (← links)
- Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601) (← links)
- Algorithmic Aspects of Optimal Channel Coding (Q4566684) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- (Q4633919) (← links)
- Algorithmic Aspects of Private Bayesian Persuasion. (Q4638086) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
- Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5236307) (← links)
- Decomposition Methods for Large Scale LP Decoding (Q5346195) (← links)
- (Q5417634) (← links)
- (Q5743493) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
- Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
- (Q5874477) (← links)
- The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies (Q6199243) (← links)
- Approximation algorithms for envy-free cake division with connected pieces (Q6638008) (← links)
