Raga Gopalakrishnan

Electrical, Computer, and Energy Engineering, University of Colorado Boulder

Office: ECEE 1B93        Mailstop: 425 UCB

Email: Ragavendran.Gopalakrishnan [at] xerox [dot] com



About me

UPDATE: I'm now a Research Scientist within the Algorithms and Optimization Group at Xerox Research Center India (XRCI), Bangalore. Click here to visit me there.

I moved to the University of Colorado Boulder as a Postdoctoral Research Associate in Fall 2013, supervised by Dr. Jason Marden. I graduated from California Institute of Technology with my PhD in June 2013, advised by Dr. Adam Wierman. At Caltech, I was affiliated with two research groups - Rigorous Systems Research Group (RSRG) and Social and Information Sciences Laboratory (SISL). Prior to joining Caltech, I obtained my Bachelors degree in Computer Science from Indian Institute of Technology Madras. You can find my CV here.


Research summary

My research interests lie in the domain of applied algorithmic game theory (AGT). Traditional applications of AGT have been in the field of auction theory and mechanism design. However, my recent focus has been on research problems in AGT that are motivated by somewhat non-traditional applications, such as distributed control, and heterogeneous multi-server queueing systems: My detailed research statement can be found here.


PhD Thesis and Defense

My thesis was exclusively on cost sharing games. For more information and to download a copy, you can visit CaltechTHESIS.
[Slides] [Video]

Recent publications

Routing and staffing when servers are strategic. (Journal Version)
with Sherwin Doroudi, Amy R. Ward, and Adam Wierman. To Appear in Operations Research, 2016.
[PDF]
Note: Select results were presented at the MSOM SERVICE SIG 2014 Conference in Seattle, WA. [Slides]

Impact of information in a simple multiagent collaborative task.
with Jason R. Marden, J. Patrick O'Brien and Behrouz Touri. CDC 2015.
[PDF]

Stable utility design for distributed resource allocation.
with Sean D. Nixon and Jason R. Marden. CDC 2014.
[PDF] [Slides]

Routing and staffing when servers are strategic.
with Sherwin Doroudi, Amy R. Ward, and Adam Wierman. EC 2014.
[PDF] [Slides]
Note: These results were also presented as part of an invited session at INFORMS APS 2013, INFORMS ANNUAL MEETING 2013, and during an invited talk at Young European Queueing Theorists (YEQT) workshop 2013. [Slides]

Potential games are necessary to ensure pure Nash equilibria in cost sharing games. (Journal Version)
with Jason R. Marden and Adam Wierman. Mathematics of Operations Research, 2014.
[PDF]

Potential games are necessary to ensure pure Nash equilibria in cost sharing games.
with Jason R. Marden and Adam Wierman. EC 2013.
[PDF] [EC Slides]
Note: These results were also presented at the Stony Brook Conference on Game Theory and Applications 2013. [Slides]

Cache me if you can: Capacitated selfish replication in networks.
with Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, and Ravi Sundaram. LATIN 2012.
[PDF] [Slides] [Full Version]

Characterizing distribution rules for cost sharing games.
with Jason R. Marden and Adam Wierman. NetGCOOP 2011.
[
PDF] [Slides]
Note: A related poster was presented at SoCal NEGT 2011. [PDF]
Note: A poster with extended results was presented at the Summer School on Algorithmic Economics 2012. [PDF]

Dispatching to incentivize fast service in multi-server queues.
with Sherwin Doroudi and Adam Wierman. MAMA 2011.
[
PDF] [Slides]
Note: These results were also presented during a SISL seminar at Caltech, and as part of an invited session at INFORMS APS 2011. [Slides]
Note: A related poster was presented at SoCal NEGT 2010. [PDF]

An architectural view of game theoretic control.
with Jason R. Marden and Adam Wierman. HotMetrics 2010.
[PDF] [Slides]
Note: A poster with preliminary ideas was presented at the 9th Lee Center Workshop on Advanced Networking 2009 and also at SoCal NEGT 2009. [PDF]

On the provable security of multi-receiver signcryption schemes.
with Naga Naresh Karuturi, C. Pandu Rangan, S. Sharmila Deva Selvi, and S. Sree Vivek. ICISC 2009.
[PDF]

Cryptanalysis of Bohio et al.'s ID-based broadcast signcryption (IBBSC) scheme for wireless ad-hoc networks.
with Naga Naresh Karuturi, C. Pandu Rangan, S. Sharmila Deva Selvi, and S. Sree Vivek. PST 2008.
[PDF]

Cryptanalysis of Mu et al.'s and Li et al.'s schemes and a provably secure ID-based broadcast signcryption (IBBSC) scheme.
with Naga Naresh Karuturi, C. Pandu Rangan, S. Sharmila Deva Selvi, and S. Sree Vivek. WISA 2008.
[SpringerLink]


Other papers

Fairness & efficiency in network performance isolation.
with Mohammad Alizadeh Attar, Vimalkumar Jeyakumar, Srinivas Narayana, and Balaji Prabhakar. Working paper.
[PDF]

Randomness and uncertainty in portfolio methods for inventory allocation in online advertising.
with Eric Bax, Krishna Prasad Chitrapura, and Sachin Garg. Working paper.
[PDF]
Note: These results were presented during RSRG and SISL seminars at Caltech. [Slides] [Video]

Foundations of group key management: Framework, security model and a generic construction.
with Naga Naresh Karuturi, C. Pandu Rangan, and Rahul Srinivasan. UNPUBLISHED MANUSCRIPT.
[PDF]


Teaching

I was a teaching assitant for CS/EE 144 - Ideas behind the Web (Winter 2011 and Winter 2012) and CS/EE 147 - Network performance analysis (Spring 2010).


My older website
This is also me