The following pages link to Jason R. Marden (Q423754):
Displayed 35 items.
- Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation (Q423755) (← links)
- Selecting efficient correlated equilibria through distributed learning (Q1682711) (← links)
- Learning to play efficient coarse correlated equilibria (Q1741209) (← links)
- State based potential games (Q1932699) (← links)
- Decoupling Coupled Constraints Through Utility Design (Q2983097) (← links)
- Generalized Efficiency Bounds in Distributed Resource Allocation (Q2983223) (← links)
- The Role of Information in Distributed Resource Allocation (Q4560053) (← links)
- The Robustness of Marginal-Cost Taxes in Affine Congestion Games (Q4589458) (← links)
- (Q4630467) (← links)
- (Q4630469) (← links)
- Design Tradeoffs in Concave Cost-Sharing Games (Q4682273) (← links)
- Optimal Mechanisms for Robust Coordination in Congestion Games (Q4682293) (← links)
- Joint Strategy Fictitious Play With Inertia for Potential Games (Q4974451) (← links)
- A Risk-Security Tradeoff in Graphical Coordination Games (Q4990201) (← links)
- Studies on Robust Social Influence Mechanisms: Incentives for Efficient Network Routing in Uncertain Settings (Q5019352) (← links)
- Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems (Q5034057) (← links)
- Multiagent Maximum Coverage Problems: The Tradeoff Between Anarchy and Stability (Q5092057) (← links)
- Policy Evaluation and Seeking for Multiagent Reinforcement Learning via Best Response (Q5092076) (← links)
- The Effectiveness of Subsidies and Tolls in Congestion Games (Q5092179) (← links)
- Can Taxes Improve Congestion on All Networks? (Q5103962) (← links)
- Achieving Pareto Optimality Through Distributed Learning (Q5173260) (← links)
- Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games (Q5190258) (← links)
- The Impact of Information in Distributed Submodular Maximization (Q5211929) (← links)
- The Importance of System-Level Information in Multiagent Systems Design: Cardinality and Covering Problems (Q5228309) (← links)
- Security Against Impersonation Attacks in Distributed Systems (Q5229183) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- The Price of Selfishness in Network Coding (Q5272018) (← links)
- Distributed Welfare Games (Q5301118) (← links)
- Overcoming the Limitations of Utility Design for Multiagent Systems (Q5353228) (← links)
- Fast Convergence in Semianonymous Potential Games (Q5358537) (← links)
- Utility Design for Distributed Resource Allocation—Part I: Characterizing and Optimizing the Exact Price of Anarchy (Q5853880) (← links)
- The Impact of Complex and Informed Adversarial Behavior in Graphical Coordination Games (Q5868121) (← links)
- Robust networked multiagent optimization: designing agents to repair their own utility functions (Q6159514) (← links)
- Robust utility design in distributed resource allocation problems with defective agents (Q6159515) (← links)
- Multiagent Maximum Coverage Problems: The Trade-off Between Anarchy and Stability (Q6292121) (← links)