CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Bhaskar-U"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: A | B
Number of items: 10.

A

Azar, Yossi and Bhaskar, Umang and Flesicher, Lisa et al. (2013) Online Mixed Packing and Covering. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , Philadelphia, PA, pp. 85-100. ISBN 978-1-61197-251-1. https://resolver.caltech.edu/CaltechAUTHORS:20160420-163337656

B

Bhaskar, Umang and Ligett, Katrina and Schulman, Leonard J. et al. (2018) Achieving target equilibria in network routing games without knowing the latency functions. Games and Economic Behavior . ISSN 0899-8256. (In Press) https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994

Bhaskar, Umang and Fleischer, Lisa and Hoy, Darrell et al. (2015) On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Mathematics of Operations Research, 40 (3). pp. 634-654. ISSN 0364-765X. https://resolver.caltech.edu/CaltechAUTHORS:20151001-111103219

Bhaskar, Umang and Fleischer, Lisa and Anshelevich, Elliot (2015) A Stackelberg strategy for routing flow over time. Games and Economic Behavior, 92 . pp. 232-247. ISSN 0899-8256. https://resolver.caltech.edu/CaltechAUTHORS:20150918-140427288

Bhaskar, Umang and Ligett, Katrina (2014) Network improvement for equilibrium routing. ACM SIGecom Exchanges, 13 (2). pp. 36-40. ISSN 1551-9031. https://resolver.caltech.edu/CaltechAUTHORS:20150220-135314566

Bhaskar, Umang and Ligett, Katrina and Schulman, Leonard J. et al. (2014) Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. In: IEEE 55th Annual Symposium on Foundations of Computer Science. IEEE , Piscataway, NJ, pp. 31-40. ISBN 978-1-4799-6517-5. https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688

Barman, Siddharth and Bhaskar, Umang and Echenique, Federico et al. (2014) The Complexity of Nash Equilibria as Revealed by Data. California Institute of Technology , Pasadena, California. https://resolver.caltech.edu/CaltechAUTHORS:20160321-140122265

Bhaskar, Umang and Ligett, Katrina and Schulman, Leonard J. (2014) Network Improvement for Equilibrium Routing. In: Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. No.8494. Springer , Cham, Switzerland, pp. 138-149. ISBN 978-3-319-07556-3. https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687

Barman, Siddharth and Bhaskar, Umang and Echenique, Federico et al. (2014) On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. In: Web and Internet Economics. Lecture Notes in Computer Science. No.8877. Springer , Cambridge, MA, pp. 447-452. ISBN 978-3-319-13129-0. https://resolver.caltech.edu/CaltechAUTHORS:20150615-083251191

Barman, Siddharth and Bhaskar, Umang and Echenique, Federico et al. (2013) The Empirical Implications of Rank in Bimatrix Games. In: EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce. ACM , New York, NY, pp. 55-72. ISBN 978-1-4503-1962-1 . https://resolver.caltech.edu/CaltechAUTHORS:20131008-155108539

This list was generated on Thu Nov 21 19:41:54 2019 PST.