Siddharth Barman

1.3k total citations
39 papers, 459 citations indexed

About

Siddharth Barman is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Siddharth Barman has authored 39 papers receiving a total of 459 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Management Science and Operations Research, 21 papers in Economics and Econometrics and 11 papers in Computer Networks and Communications. Recurrent topics in Siddharth Barman's work include Game Theory and Voting Systems (17 papers), Auction Theory and Applications (14 papers) and Economic theories and models (14 papers). Siddharth Barman is often cited by papers focused on Game Theory and Voting Systems (17 papers), Auction Theory and Applications (14 papers) and Economic theories and models (14 papers). Siddharth Barman collaborates with scholars based in United States, India and Australia. Siddharth Barman's co-authors include Stark C. Draper, Benjamin Recht, Arpita Biswas, Jeffrey F. Naughton, Yeye He, Yakov Babichenko, Adam Wierman, Lachlan L. H. Andrew, Katrina Ligett and Y. Narahari and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematics of Operations Research and ACM SIGMETRICS Performance Evaluation Review.

In The Last Decade

Siddharth Barman

33 papers receiving 455 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Siddharth Barman United States	12	221	179	174	116	111	39	459
Michele Flammini Italy	14	295 1.3×	240 1.3×	257 1.5×	131 1.1×	88 0.8×	106	698
Elitza Maneva United States	10	190 0.9×	450 2.5×	83 0.5×	208 1.8×	120 1.1×	16	718
Simon Fischer Germany	14	128 0.6×	189 1.1×	58 0.3×	65 0.6×	117 1.1×	26	427
Serge Gaspers Australia	14	140 0.6×	166 0.9×	158 0.9×	37 0.3×	110 1.0×	70	620
Paolo Penna Italy	10	118 0.5×	219 1.2×	44 0.3×	50 0.4×	46 0.4×	48	367
Varsha Dani United States	10	402 1.8×	243 1.4×	71 0.4×	47 0.4×	362 3.3×	22	582
Martin Gairing United Kingdom	15	315 1.4×	149 0.8×	215 1.2×	15 0.1×	25 0.2×	35	466
Mukund Sundararajan United States	10	67 0.3×	89 0.5×	35 0.2×	50 0.4×	429 3.9×	13	539
Giuseppe Persiano Italy	14	89 0.4×	147 0.8×	35 0.2×	27 0.2×	422 3.8×	71	604
Steve Chien United States	8	117 0.5×	116 0.6×	61 0.4×	13 0.1×	119 1.1×	12	432

Countries citing papers authored by Siddharth Barman

Since Specialization

Citations

This map shows the geographic impact of Siddharth Barman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Siddharth Barman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Siddharth Barman more than expected).

Fields of papers citing papers by Siddharth Barman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Siddharth Barman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Siddharth Barman. The network helps show where Siddharth Barman may publish in the future.

Co-authorship network of co-authors of Siddharth Barman

This figure shows the co-authorship network connecting the top 25 collaborators of Siddharth Barman. A scholar is included among the top collaborators of Siddharth Barman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Siddharth Barman. Siddharth Barman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Barman, Siddharth, et al.. (2023). Finding Fair Allocations under Budget Constraints. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5481–5489. 5 indexed citations

Barman, Siddharth, et al.. (2022). Abundance of trace and rare earth elements (REE) in ferromanganese nodules of the central Indian ocean basin. Journal of Mines Metals and Fuels. 283–290. 1 indexed citations

Barman, Siddharth, et al.. (2022). Universal and Tight Online Algorithms for Generalized-Mean Welfare. Proceedings of the AAAI Conference on Artificial Intelligence. 36(5). 4793–4800. 5 indexed citations

Barman, Siddharth, et al.. (2022). Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 60–66. 6 indexed citations

Barman, Siddharth, et al.. (2022). Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Mathematics of Operations Research. 47(3). 1970–1998. 2 indexed citations

Barman, Siddharth, et al.. (2020). Approximation Algorithms for Maximin Fair Division. ePrints@IISc (Indian Institute of Science). 8(1). 1–28. 34 indexed citations

Barman, Siddharth, et al.. (2019). Fair Division of Indivisible Goods Among Strategic Agents. ePrints@IISc (Indian Institute of Science). 1811–1813. 5 indexed citations

Biswas, Arpita & Siddharth Barman. (2018). Fair Division Under Cardinality Constraints. 91–97. 24 indexed citations

Barman, Siddharth, et al.. (2018). Groupwise Maximin Fair Allocation of Indivisible Goods. Proceedings of the AAAI Conference on Artificial Intelligence. 32(1). 23 indexed citations

10.

Barman, Siddharth, et al.. (2017). Approximation Algorithms for Maximin Fair Division. 647–664. 52 indexed citations

11.

Babichenko, Yakov & Siddharth Barman. (2017). Algorithmic Aspects of Private Bayesian Persuasion. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 5 indexed citations

12.

Babichenko, Yakov, et al.. (2016). Empirical Distribution of Equilibrium Play and Its Testing Application. Mathematics of Operations Research. 42(1). 15–29. 7 indexed citations

13.

Barman, Siddharth & Katrina Ligett. (2015). Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. 815–816. 4 indexed citations

14.

Babichenko, Yakov & Siddharth Barman. (2015). Query Complexity of Correlated Equilibrium. CaltechAUTHORS (California Institute of Technology). 3(4). 1–9. 6 indexed citations

15.

Chen, Niangjun, Anish Agarwal, Adam Wierman, Siddharth Barman, & Lachlan L. H. Andrew. (2015). Online Convex Optimization Using Predictions. ACM SIGMETRICS Performance Evaluation Review. 43(1). 191–204. 22 indexed citations

16.

Barman, Siddharth & Shuchi Chawla. (2012). Traffic-redundancy aware network design. Symposium on Discrete Algorithms. 1487–1498.

17.

Sun, Chong, Jeffrey F. Naughton, & Siddharth Barman. (2012). Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. 882–893. 2 indexed citations

18.

He, Yeye, Siddharth Barman, & Jeffrey F. Naughton. (2011). Preventing equivalence attacks in updated, anonymized data. 529–540. 26 indexed citations

19.

Barman, Siddharth, et al.. (2011). Decomposition methods for large scale LP decoding. 253–260. 24 indexed citations

20.

Barman, Siddharth & Shuchi Chawla. (2009). Packing multiway cuts in capacitated graphs. Minds at UW (University of Wisconsin). 1048–1057.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact