Ragavendran Gopalakrishnan

Orcid: 0000-0001-7767-3914

Affiliations:
  • California Institute of Technology, Pasadena, USA


According to our database1, Ragavendran Gopalakrishnan authored at least 23 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Cache Me if You Can: Capacitated Selfish Replication Games in Networks.
Theory Comput. Syst., 2020

2018
The Price of Indivisibility in Cake Cutting.
CoRR, 2018

Impact of Detour-Aware Policies on Maximizing Profit in Ridesharing.
Proceedings of the Tenth International Workshop on Agents in Traffic and Transportation (ATT 2018) co-located with with the Federated Artificial Intelligence Meeting, 2018

2017
Profit Optimization in Commercial Ridesharing.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Routing and Staffing When Servers Are Strategic.
Oper. Res., 2016

The Costs and Benefits of Ridesharing: Sequential Individual Rationality and Sequential Fairness.
CoRR, 2016

Demand Prediction and Placement Optimization for Electric Vehicle Charging Stations.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Managing Overstaying Electric Vehicles in Park-and-Charge Facilities.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Portfolio Allocation for Sellers in Online Advertising.
CoRR, 2015

Impact of information in a simple multiagent collaborative task.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014
Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games.
Math. Oper. Res., 2014

Stable utility design for distributed resource allocation.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013
Potential games are necessary to ensure pure nash equilibria in cost sharing games.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
Cache Me If You Can: Capacitated Selfish Replication Games.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Dispatching to incentivize fast service in multi-server queues.
SIGMETRICS Perform. Evaluation Rev., 2011

Characterizing distribution rules for cost sharing games.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

2010
An architectural view of game theoretic control.
SIGMETRICS Perform. Evaluation Rev., 2010

Capacitated Caching Games
CoRR, 2010

2008
Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-hoc Networks.
IACR Cryptol. ePrint Arch., 2008

On the Provable Security of Multi-Receiver Signcryption Schemes.
IACR Cryptol. ePrint Arch., 2008

Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
IACR Cryptol. ePrint Arch., 2008

Foundations of Group Key Management - Framework, Security Model and a Generic Construction.
IACR Cryptol. ePrint Arch., 2008

Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
Proceedings of the Information Security Applications, 9th International Workshop, 2008


  Loading...