default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahul Chandan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Keith Paarporn
, Rahul Chandan, Dan Kovenock, Mahnoosh Alizadeh, Jason R. Marden:
Strategically Revealing Intentions in General Lotto Games. IEEE Trans. Autom. Control. 69(8): 5396-5407 (2024)- [j6]Rohit Konda, Rahul Chandan, David Grimsman, Jason R. Marden:
Optimal Utility Design of Greedy Algorithms in Resource Allocation Games. IEEE Trans. Autom. Control. 69(10): 6592-6604 (2024) - [j5]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Methodologies for Quantifying and Optimizing the Price of Anarchy. IEEE Trans. Autom. Control. 69(11): 7742-7757 (2024) - [i19]Rohit Konda, Rahul Chandan, Jason R. Marden:
Quality of Non-Convergent Best Response Processes in Multi-Agent Systems through Sink Equilibrium. CoRR abs/2405.20426 (2024) - [i18]Rohit Konda, Rahul Chandan, David Grimsman, Jason R. Marden:
Best Response Sequences and Tradeoffs in Submodular Resource Allocation Games. CoRR abs/2406.17791 (2024) - 2023
- [c15]Keith Paarporn, Rahul Chandan, Dan Kovenock, Mahnoosh Alizadeh, Jason R. Marden:
Analyzing pre-commitment strategies in General Lotto games. ACC 2023: 441-446 - [c14]Rohit Konda, Rahul Chandan, Jason R. Marden:
Quality of Non-Convergent Best Response Processes in Multi-Agent Systems through Sink Equilibria. CDC 2023: 6996-7001 - [i17]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
Reinforcement Strategies in General Lotto Games. CoRR abs/2308.14299 (2023) - 2022
- [b1]Rahul Chandan:
Strategic Mechanisms in Multi-Agent Coordination. University of California, Santa Barbara, USA, 2022 - [j4]Dario Paccagnan, Rahul Chandan, Jason R. Marden:
Utility and mechanism design in multi-agent systems: An overview. Annu. Rev. Control. 53: 315-328 (2022) - [j3]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
Asymmetric Battlefield Uncertainty in General Lotto Games. IEEE Control. Syst. Lett. 6: 2822-2827 (2022) - [c13]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
The importance of randomization in resource assignment problems. ACC 2022: 621-626 - [c12]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
The Tension Between Anarchy and Stability in Congestion Games. ACC 2022: 1260-1265 - [c11]Rohit Konda, Rahul Chandan, David Grimsman, Jason R. Marden:
Balancing Asymptotic and Transient Efficiency Guarantees in Set Covering Games. ACC 2022: 4416-4421 - [c10]Rahul Chandan, Keith Paarporn, Mahnoosh Alizadeh, Jason R. Marden:
Strategic investments in multi-stage General Lotto games. CDC 2022: 4444-4448 - [c9]Rahul Chandan, Keith Paarporn, Dan Kovenock, Mahnoosh Alizadeh, Jason R. Marden:
The Art of Concession in General Lotto Games. GAMENETS 2022: 310-327 - [i16]Rohit Konda, Rahul Chandan, David Grimsman, Jason R. Marden:
Optimal Design of Best Response Dynamics in Resource Allocation Games. CoRR abs/2204.10364 (2022) - [i15]Rahul Chandan, Keith Paarporn, Mahnoosh Alizadeh, Jason R. Marden:
Strategic investments in multi-stage General Lotto games. CoRR abs/2209.06090 (2022) - 2021
- [j2]Dario Paccagnan, Rahul Chandan, Bryce L. Ferguson, Jason R. Marden:
Optimal Taxes in Atomic Congestion Games. ACM Trans. Economics and Comput. 9(3): 19:1-19:33 (2021) - [c8]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Tractable Mechanisms for Computing Near-Optimal Utility Functions. AAMAS 2021: 306-313 - [c7]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
The Division of Assets in Multiagent Systems: A Case Study in Team Blotto Games. CDC 2021: 1663-1668 - [c6]Rohit Konda, Rahul Chandan, Jason R. Marden:
Mission Level Uncertainty in Multi-Agent Resource Allocation. CDC 2021: 4521-4526 - [i14]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Tractable mechanisms for computing near-optimal utility functions. CoRR abs/2102.04542 (2021) - [i13]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
The Division of Assets in Multiagent Systems: A Case Study in Team Blotto Games. CoRR abs/2103.16688 (2021) - [i12]Rohit Konda, Rahul Chandan, Jason R. Marden:
Mission Level Uncertainty in Multi-Agent Resource Allocation. CoRR abs/2106.04029 (2021) - [i11]Rohit Konda, Rahul Chandan, David Grimsman, Jason R. Marden:
Balancing Asymptotic and Transient Efficiency Guarantees in Set Covering Games. CoRR abs/2106.04031 (2021) - [i10]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
A General Lotto game with asymmetric budget uncertainty. CoRR abs/2106.12133 (2021) - [i9]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
The Anarchy-Stability Tradeoff in Congestion Games. CoRR abs/2107.06331 (2021) - [i8]Keith Paarporn, Rahul Chandan, Dan Kovenock, Mahnoosh Alizadeh, Jason R. Marden:
Strategically revealing intentions in General Lotto games. CoRR abs/2110.12099 (2021) - 2020
- [j1]Dario Paccagnan, Rahul Chandan, Jason R. Marden:
Utility Design for Distributed Resource Allocation - Part I: Characterizing and Optimizing the Exact Price of Anarchy. IEEE Trans. Autom. Control. 65(11): 4616-4631 (2020) - [c5]Rahul Chandan, Keith Paarporn, Jason R. Marden:
When showing your hand pays off: Announcing strategic intentions in Colonel Blotto games. ACC 2020: 4632-4637 - [i7]Rahul Chandan, Keith Paarporn, Jason R. Marden:
When showing your hand pays off: Announcing strategic intentions in Colonel Blotto games. CoRR abs/2002.11648 (2020)
2010 – 2019
- 2019
- [c4]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Optimal Price of Anarchy in Cost-Sharing Games. ACC 2019: 2277-2282 - [c3]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-Anarchy. CDC 2019: 4041-4046 - [c2]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
Characterizing the interplay between information and strength in Blotto games. CDC 2019: 5977-5982 - [c1]Rahul Chandan, Dario Paccagnan, Bryce L. Ferguson, Jason R. Marden:
Computing optimal taxes in atomic congestion games. NetEcon@SIGMETRICS 2019: 2:1 - [i6]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Optimal Price of Anarchy in Cost-Sharing Games. CoRR abs/1903.06288 (2019) - [i5]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-Anarchy. CoRR abs/1904.10915 (2019) - [i4]Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden:
Characterizing the interplay between information and strength in Blotto games. CoRR abs/1909.03382 (2019) - [i3]Rahul Chandan, Dario Paccagnan, Jason R. Marden:
Optimal mechanisms for distributed resource-allocation. CoRR abs/1911.07823 (2019) - [i2]Dario Paccagnan, Rahul Chandan, Bryce L. Ferguson, Jason R. Marden:
Incentivizing efficient use of shared infrastructure: Optimal tolls in congestion games. CoRR abs/1911.09806 (2019) - 2018
- [i1]Dario Paccagnan, Rahul Chandan, Jason R. Marden:
Distributed resource allocation through utility design - Part I: optimizing the performance certificates via the price of anarchy. CoRR abs/1807.01333 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
