30 citations · 51 across the 16 of their papers we have counts for
19 papers
Best Response Sequences and Tradeoffs in Submodular Resource Allocation Games
Rohit Konda, Rahul Chandan, David Grimsman +1
Deriving competitive, distributed solutions to multi-agent problems is crucial for many developing application domains; Game theory has emerged as a useful framework to design such…
Quality of Non-Convergent Best Response Processes in Multi-Agent Systems through Sink Equilibrium
Rohit Konda, Rahul Chandan, Jason Marden
Examining the behavior of multi-agent systems is vitally important to many emerging distributed applications - game theory has emerged as a powerful tool set in which to do so. The…
Reinforcement Strategies in General Lotto Games
Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh +1
Strategic decisions are often made over multiple periods of time, wherein decisions made earlier impact a competitor's success in later stages. In this paper, we study these dynami…
Strategic investments in multi-stage General Lotto games
Rahul Chandan, Keith Paarporn, Mahnoosh Alizadeh +1
In adversarial interactions, one is often required to make strategic decisions over multiple periods of time, wherein decisions made earlier impact a player's competitive standing…
Optimal Utility Design of Greedy Algorithms in Resource Allocation Games
Rohit Konda, Rahul Chandan, David Grimsman +1
Designing distributed algorithms for multi-agent problems is vital for many emerging application domains, and game-theoretic approaches are emerging as a useful paradigm to design…
Strategically revealing intentions in General Lotto games
Keith Paarporn, Rahul Chandan, Dan Kovenock +2
Strategic decision-making in uncertain and adversarial environments is crucial for the security of modern systems and infrastructures. A salient feature of many optimal decision-ma…
The Unintended Consequences of Minimizing the Price of Anarchy in Congestion Games
Rahul Chandan, Dario Paccagnan, Jason R. Marden
This work focuses on the design of taxes in atomic congestion games, a commonly studied model for competitive resource sharing. While most related studies focus on optimizing eithe…
Mission Level Uncertainty in Multi-Agent Resource Allocation
Rohit Konda, Rahul Chandan, Jason R. Marden
In recent years, a significant research effort has been devoted to the design of distributed protocols for the control of multi-agent systems, as the scale and limited communicatio…
A General Lotto game with asymmetric budget uncertainty
Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh +1
The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we co…
Balancing Asymptotic and Transient Efficiency Guarantees in Set Covering Games
Rohit Konda, Rahul Chandan, David Grimsman +1
Game theoretic approaches have gained traction as robust methodologies for designing distributed local algorithms that induce a desired overall system configuration in multi-agent…
The Division of Assets in Multiagent Systems: A Case Study in Team Blotto Games
Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh +1
Multi-agent systems are designed to concurrently accomplish a diverse set of tasks at unprecedented scale. Here, the central problems faced by a system operator are to decide (i) h…
Tractable mechanisms for computing near-optimal utility functions
Rahul Chandan, Dario Paccagnan, Jason R. Marden
Large scale multiagent systems must rely on distributed decision making, as centralized coordination is either impractical or impossible. Recent works approach this problem under a…
When showing your hand pays off: Announcing strategic intentions in Colonel Blotto games
Rahul Chandan, Keith Paarporn, Jason R. Marden
In competitive adversarial environments, it is often advantageous to obfuscate one's strategies or capabilities. However, revealing one's strategic intentions may shift the dynamic…
Optimal Taxes in Atomic Congestion Games
Dario Paccagnan, Rahul Chandan, Bryce L Ferguson +1
How can we design mechanisms to promote efficient use of shared resources? Here, we answer this question in relation to the well-studied class of atomic congestion games, used to m…
When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price of Anarchy
Rahul Chandan, Dario Paccagnan, Jason R. Marden
The price of anarchy (PoA) is a popular metric for analyzing the inefficiency of self-interested decision making. Although its study is widespread, characterizing the PoA can be ch…
Characterizing the interplay between information and strength in Blotto games
Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh +1
In this paper, we investigate informational asymmetries in the Colonel Blotto game, a game-theoretic model of competitive resource allocation between two players over a set of batt…
When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-Anarchy
Rahul Chandan, Dario Paccagnan, Jason R. Marden
Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game t…
Optimal Price of Anarchy in Cost-Sharing Games
Rahul Chandan, Dario Paccagnan, Jason R. Marden
The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propo…
Utility Design for Distributed Resource Allocation -- Part I: Characterizing and Optimizing the Exact Price of Anarchy
Dario Paccagnan, Rahul Chandan, Jason R. Marden
Game theory has emerged as a fruitful paradigm for the design of networked multiagent systems. A fundamental component of this approach is the design of agents' utility functions s…