Siddharth Barman
Siddharth Barman
Department of Computer Science and Automation, IISc
Verified email at - Homepage
Cited by
Cited by
Finding fair and efficient allocations
S Barman, SK Krishnamurthy, R Vaish
Proceedings of the 2018 ACM Conference on Economics and Computation, 557-574, 2018
Approximation algorithms for maximin fair division
S Barman, SK Krishnamurthy
ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-28, 2020
Decomposition methods for large scale LP decoding
S Barman, X Liu, SC Draper, B Recht
IEEE Transactions on Information Theory 59 (12), 7870-7886, 2013
Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory's theorem
S Barman
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
Online convex optimization using predictions
N Chen, A Agarwal, A Wierman, S Barman, LLH Andrew
Proceedings of the 2015 ACM SIGMETRICS International Conference on …, 2015
A tale of two metrics: Simultaneous bounds on competitiveness and regret
L Andrew, S Barman, K Ligett, M Lin, A Meyerson, A Roytman, A Wierman
Conference on Learning Theory, 741-763, 2013
Fair Division Under Cardinality Constraints.
A Biswas, S Barman
IJCAI, 91-97, 2018
Greedy algorithms for maximizing Nash social welfare
S Barman, SK Krishnamurthy, R Vaish
arXiv preprint arXiv:1801.09046, 2018
Groupwise maximin fair allocation of indivisible goods
S Barman, A Biswas, S Krishnamurthy, Y Narahari
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
On the proximity of markets with integral equilibria
S Barman, SK Krishnamurthy
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1748-1755, 2019
Preventing equivalence attacks in updated, anonymized data
Y He, S Barman, JF Naughton
2011 IEEE 27th International Conference on Data Engineering, 529-540, 2011
Optimal bounds on the price of fairness for indivisible goods
S Barman, U Bhaskar, N Shah
International Conference on Web and Internet Economics, 356-369, 2020
On load shedding in complex event processing
Y He, S Barman, JF Naughton
arXiv preprint arXiv:1312.4283, 2013
On the complexity of privacy-preserving complex event processing
Y He, S Barman, D Wang, JF Naughton
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011
Tight approximation algorithms for p-mean welfare under subadditive valuations
S Barman, U Bhaskar, A Krishna, RG Sundaram
arXiv preprint arXiv:2005.07370, 2020
Algorithmic aspects of private Bayesian persuasion
Y Babichenko, S Barman
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
Fair division of indivisible goods among strategic agents
S Barman, G Ghalme, S Jain, P Kulkarni, S Narang
arXiv preprint arXiv:1901.09427, 2019
Variability of millimetrewave rain attenuation and rain rate prediction: A survey
R Bhattacharya, R Das, R Guha, SD Barman, AB Bhattacharya
CSIR, 2007
Existence and computation of maximin fair allocations under matroid-rank valuations
S Barman, P Verma
arXiv preprint arXiv:2012.12710, 2020
Simple approximate equilibria in large games
Y Babichenko, S Barman, R Peretz
Proceedings of the fifteenth ACM conference on Economics and computation …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20