Umang Bhaskar

422 total citations
16 papers, 126 citations indexed

About

Umang Bhaskar is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Umang Bhaskar has authored 16 papers receiving a total of 126 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Management Science and Operations Research, 12 papers in Economics and Econometrics and 4 papers in Computer Networks and Communications. Recurrent topics in Umang Bhaskar's work include Game Theory and Voting Systems (12 papers), Game Theory and Applications (11 papers) and Auction Theory and Applications (7 papers). Umang Bhaskar is often cited by papers focused on Game Theory and Voting Systems (12 papers), Game Theory and Applications (11 papers) and Auction Theory and Applications (7 papers). Umang Bhaskar collaborates with scholars based in United States, India and Canada. Umang Bhaskar's co-authors include Lisa Fleischer, Chaitanya Swamy, Chien‐Chung Huang, Yu Cheng, Elliot Anshelevich, Yossi Azar, Debmalya Panigrahi, Varsha Dani, Katrina Ligett and Leonard J. Schulman and has published in prestigious journals such as Mathematics of Operations Research, Games and Economic Behavior and arXiv (Cornell University).

In The Last Decade

Umang Bhaskar

15 papers receiving 120 citations

Peers

Umang Bhaskar

MSOR

EE

CNC

TRANS

CTM

Thomas Lücking Germany

Alexander Skopalik Germany

Nir Andelman Israel

Akash Nanavati United States

Łukasz Kruk Poland

Bo Waggoner United States

Chenhao Wang China

Karthyek Murthy Singapore

Gregg O’Malley United Kingdom

John Fearnley United Kingdom

Thomas Lücking Germany

Umang Bhaskar

129 ×1.3

MSOR

89 ×1.2

EE

58 ×2.1

CNC

4 ×0.2

TRANS

14 ×0.8

CTM

Citations per year, relative to Umang Bhaskar Umang Bhaskar (= 1×) peers Thomas Lücking

Countries citing papers authored by Umang Bhaskar

Since Specialization

Citations

This map shows the geographic impact of Umang Bhaskar'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 Umang Bhaskar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Umang Bhaskar more than expected).

Fields of papers citing papers by Umang Bhaskar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Umang Bhaskar. 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 Umang Bhaskar. The network helps show where Umang Bhaskar may publish in the future.

Co-authorship network of co-authors of Umang Bhaskar

This figure shows the co-authorship network connecting the top 25 collaborators of Umang Bhaskar. A scholar is included among the top collaborators of Umang Bhaskar 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 Umang Bhaskar. Umang Bhaskar 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:

16 of 16 papers shown

1.

Bhaskar, Umang, et al.. (2018). Equilibrium Computation in Atomic Splittable Routing Games.. European Symposium on Algorithms. 1 indexed citations

2.

Bhaskar, Umang, Katrina Ligett, Leonard J. Schulman, & Chaitanya Swamy. (2018). Achieving target equilibria in network routing games without knowing the latency functions. Games and Economic Behavior. 118. 533–569. 5 indexed citations

3.

Bhaskar, Umang, et al.. (2018). Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. Proceedings of the AAAI Conference on Artificial Intelligence. 32(1). 12 indexed citations

4.

Ahmadian, Sara, Umang Bhaskar, Laura Sanità, & Chaitanya Swamy. (2018). Algorithms for Inverse Optimization Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

5.

Bhaskar, Umang, et al.. (2018). On the Welfare of Cardinal Voting Mechanisms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

6.

Bhaskar, Umang, et al.. (2016). Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. 479–496. 24 indexed citations

7.

Bhaskar, Umang, Ajil Jalal, & Rahul Vaze. (2016). The Adwords Problem with Strict Capacity Constraints. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

8.

Bhaskar, Umang & Katrina Ligett. (2015). Network improvement for equilibrium routing. ACM SIGecom Exchanges. 13(2). 36–40. 1 indexed citations

9.

Bhaskar, Umang, et al.. (2014). On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Mathematics of Operations Research. 40(3). 634–654. 5 indexed citations

10.

Bhaskar, Umang, Katrina Ligett, Leonard J. Schulman, & Chaitanya Swamy. (2014). Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. 31–40. 10 indexed citations

11.

Azar, Yossi, Umang Bhaskar, Lisa Fleischer, & Debmalya Panigrahi. (2013). Online mixed packing and covering. arXiv (Cornell University). 85–100. 18 indexed citations

12.

Bhaskar, Umang, Lisa Fleischer, & Elliot Anshelevich. (2013). A Stackelberg strategy for routing flow over time. Games and Economic Behavior. 92. 232–247. 12 indexed citations

13.

Barman, Siddharth, Umang Bhaskar, Federico Echenique, & Adam Wierman. (2013). The empirical implications of rank in Bimatrix games. 13. 55–72.

14.

Bhaskar, Umang, Lisa Fleischer, & Elliot Anshelevich. (2011). A Stackelberg strategy for routing flow over time. arXiv (Cornell University). 92. 192–201. 2 indexed citations

15.

Bhaskar, Umang, et al.. (2009). Equilibria of atomic flow games are not unique. Symposium on Discrete Algorithms. 748–757. 22 indexed citations

16.

Bhaskar, Umang, et al.. (2009). Equilibria of Atomic Flow Games are not Unique. 748–757. 10 indexed citations

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