Modeling Vaccinations, Virus Variants and Lockdown: Early guidance for Sars-Cov-2 health policies in India, Yi Zhang and Sanjiv Kapoor, Royal Society Open Science, October 2025, Vol.12, 242277.
Equilibrium and Price of Anarchy in Contagion Games, Yi Zhang and Sanjiv Kapoor, arXiv:2503.00078v1, 2024.
Impact of Vaccination and Testing in an Urban Campus model for the SARS-CoV-2 Pandemic, Yi Zhang and Sanjiv Kapoor, ACM Conference on Information Technology for Social Good, Cyprus, 2022.
Hidden Parameters Impacting Resurgence of SARS-CoV-2 Pandemic, Zhang Yi and Sanjiv Kapoor, medRxiv, 2021.
Strategic release of lockdowns in a COVID infection model, Zhang, Yi and Hota, Mohit and Kapoor, Sanjiv, medRxiv, 2020.
Combinatorial Approach to Market Equilibrium
Equilibrium and Price of Anarchy in Two-Sided Markets with Substitutable Goods, M. Hota and Sanjiv Kapoor, Preprint, 2023.
Equilibrium in Market Models Exhibiting the Impact of Relative Consumption, M. Hota and Sanjiv Kapoor, Preprint, 2023.
Equilibrium and inefficiency in multi-product Cournot games, M. Hota, S. Kapoor, Proceedings of the International Conference on Web and Internet Economics, pp. 203-217, 2018.
A Fast and Simple Algorithm for Computing Market Equilibria, Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi, ACM Transactions on Algorithms, 2016.
Buy-Sell Auction Mechanisms in Market Equilibrium, Sanjiv Kapoor, LNCS, Workshop on Internet and Network Economics, 2011.
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities, Rahul Garg, Sanjiv Kapoor, LNCS, Workshop on Internet and Network Economics, 2007.
Price Roll-Back and Path Auctions: A polynomial-time algorithm for the Fisher model, R. Garg and S. Kapoor, LNCS, Workshop on Internet and Network Economics, 2006.
Auction algorithms for Market Equilibrium, R. Garg and Sanjiv Kapoor, Mathematics of Operations Research, Vol. 31, No. 4, pp. 714-729, Dec. 2006 (Also in ACM STOC 2004).
Auction Algorithms for a Production Model, S. Kapoor, A. Mehta and V.V. Vazirani, LNCS, Workshop on Internet and Network Economics, 2005.
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case, Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani, APPROX-RANDOM, LNCS(3122), Springer-Verlag, pp. 128-138, 2004.
Game Theory in Networks
The Complexity of Nash and Stackelberg Equilibrium in Wireless Network Games, Li Zhang and Sanjiv Kapoor, GameNets, 2026.
Fairness of Equilibrium in Proportional Sharing Mechanisms with Bid Costs, Li Zhang and Sanjiv Kapoor, 60th Allerton Conference on Communication, Control, and Computing (Allerton), 2024.
Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks, Proceedings of Game Theory for Networks. 11th International EAI Conference, GameNets, 2022.
Budgeted Adversarial Network Resource Utilization Games, Yi Zhang and Sanjiv Kapoor, Proceedings of 11th International EAI Conference, GameNets, July 2022.
Price of anarchy with heterogeneous latency functions, S. Kapoor and J. Shin, Mathematics of Operations Research, Vol. 45, No. 2, pp. 755-773, 2020.
Priority Based Wireless Multi-Network Selection Games, M. Hota, S. Kapoor, Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018.
Economic inefficiency in resource allocation games, P. Tota, S. Kapoor, B. Grimmer, 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE, 2017.
Nash equilibrium and stability in network selection games, M. Hota, S. Kapoor, International Conference on Game Theory for Networks, pp. 40-50, 2017.
Nash equilibrium and the price of anarchy in priority based network routing, B. Grimmer, S. Kapoor, INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, IEEE, 2016.
Price of Anarchy in Network Routing with Class based capacity Guarantees, Ehsan Monsef, Tricha Anjali, Sanjiv Kapoor, IEEE INFOCOM, 2014.
Adversary Games in Secure/Reliable Network Routing, G. Calinescu, S. Kapoor, M. Quinn and J. Shin, GameNets, 2011.
Stochastic Strategic Routing Reduces Attack Effects, Gruia Calinescu, Sanjiv Kapoor, K. Qiao, Junghwan Shin, IEEE GLOBECOM, pp. 1-5, 2011.
Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels, Ping Xu, Sanjiv Kapoor, Xiang-Yang Li, IEEE GLOBECOM, 2011.
Stochastic Rearrangement Rules for Self-Organizing Data Structures, S. Kapoor and E.M. Reingold, Algorithmica, 6:278-291, 1991.
Optimum Lopsided Binary Trees, S. Kapoor and E.M. Reingold, Journal of the ACM, Vol. 36, No. 3, pp. 573-590, July 1989.
An Algorithm for Enumerating All Spanning Trees of a Directed Graph, Sanjiv Kapoor, H. Ramesh, Algorithmica, 27(2): 120-130, 2000.
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs, S. Kapoor and H. Ramesh, SIAM Journal on Computing, Vol. 24, No. 3, 1995.
Multipath Network Flows: Bounded Buffers and Jitter, Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam, IEEE INFOCOM, pp. 2714-2720, 2010.
Approximation Algorithms For Multipath Setup, Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor, IEEE GLOBECOM, pp. 438-442, 2007.
Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks, G. Calinescu, S. Kapoor, A. Olshevsky and A. Zelikovsky, Proceedings of European Symposium on Algorithms (ESA '03), LNCS 2832, pp. 114-126, September 2003.
Improved Multicast Routing with Delay and Delay Variation Constraints, S. Kapoor and S. Raghavan, IEEE GLOBECOM, San Francisco, Nov. 2000.
On Minimum 3-cuts and Approximating k-cuts using Cut Trees, Sanjiv Kapoor, Proceedings of 5th International IPCO Conference, LNCS, Springer-Verlag, 1996.
Speeding up Karmarkar's Algorithm for Multi-Commodity Flows, S. Kapoor and P. Vaidya, Mathematical Programming, Volume 73, Issue 1, pp. 111-127, April 1996.
Efficient Algorithms for Quadratic programming and Multi-Commodity Flows, S. Kapoor and P. Vaidya, Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 147-159, 1986.
Shortest Path and Visibility Problems
Planar rectilinear shortest path computation using corridors, R. Inkulu, Sanjiv Kapoor, Computational Geometry, 42(9): 873-884, 2009.
Visibility queries in a polygonal region, Rajasekhar Inkulu, Sanjiv Kapoor, Computational Geometry, 42(9): 852-864, 2009.
Efficiently constructing the visibility graph of a Simple Polygon with Obstacles, S. Kapoor and S.N. Maheshwari, SIAM Journal on Computing, Vol. 30, No. 3, pp. 847-871, 2000.
Efficiently computing Geodesic Shortest Paths, Sanjiv Kapoor, ACM Symposium on Theory of Computing (STOC), May 1999.
An Efficient Algorithm for Euclidean Shortest Paths amongst Polygonal Obstacles, S. Kapoor, S.N. Maheshwari, and J.S.B. Mitchell, Discrete & Computational Geometry, 1997.
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles, S. Kapoor and S.N. Maheshwari, 4th Annual ACM Symposium on Computational Geometry (SoCG), pp. 172-182, 1988.
Rectilinear shortest paths through polygonal obstacles in $O(n(\log n)^2)$ time, K. Clarkson, S. Kapoor, and P. Vaidya, Proceedings of the 3rd Annual Symposium on Computational Geometry (SoCG), pp. 251-257, 1987.
Dynamic Data Structures in Computational Geometry
Dynamic Maintenance of Maxima of 2-d Point Sets, Sanjiv Kapoor, SIAM Journal on Computing, 29(6): 1858-1877, 2000 (Also in ACM SoCG 1994).
New techniques for exact and approximate dynamic closest-point problems, S. Kapoor and M. Smid, SIAM Journal on Computing, August 1996 (Also in 10th ACM SoCG 1994).
On the Dynamic Maintenance of 2-D Convex Hulls, Sanjiv Kapoor, Technical Report Max-Planck-Institut für Informatik, 1995.
On the Complexity of approximating travelling salesman tours and minimum spanning trees, G. Das, S. Kapoor, and M. Smid, Algorithmica, 1997 (Preprint 1996).
Lower Bounds on Maximal Layer and Convex Hull Problems, S. Kapoor and P. Ramanan, Algorithmica, 4, pp. 447-459, 1989.