default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason R. Marden
- > Home > Persons > Jason R. Marden
Publications
- 2024
[j47]Bryce L. Ferguson
, Philip N. Brown, Jason R. Marden:
Information Signaling With Concurrent Monetary Incentives in Bayesian Congestion Games. IEEE Trans. Intell. Transp. Syst. 25(7): 8028-8041 (2024)- 2023
- [j45]Bryce L. Ferguson, Dario Paccagnan, Jason R. Marden:
The Cost of Informing Decision-Makers in Multi-Agent Maximum Coverage Problems With Random Resource Values. IEEE Control. Syst. Lett. 7: 2928-2933 (2023) - [j43]Bryce L. Ferguson, Jason R. Marden:
Robust Utility Design in Distributed Resource Allocation Problems with Defective Agents. Dyn. Games Appl. 13(1): 208-230 (2023) - [j41]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Value of Information in Incentive Design: A Case Study in Simple Congestion Networks. IEEE Trans. Comput. Soc. Syst. 10(6): 3077-3088 (2023) - [c84]Austin K. Chen, Bryce L. Ferguson, Daigo Shishika, Michael R. Dorothy, Jason R. Marden, George J. Pappas, Vijay Kumar:
Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information. ACC 2023: 447-453 - [c80]Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden:
Collaborative Coalitions in Multi-Agent Systems: Quantifying the Strong Price of Anarchy for Resource Allocation Games. CDC 2023: 3238-3243 - [i48]Runyu Zhang, Yuyang Zhang, Rohit Konda, Bryce L. Ferguson, Jason R. Marden, Na Li:
Markov Games with Decoupled Dynamics: Price of Anarchy and Sample Complexity. CoRR abs/2304.03840 (2023) - [i46]Bryce L. Ferguson, Dario Paccagnan, Jason R. Marden:
The Cost of Informing Decision-Makers in Multi-Agent Maximum Coverage Problems with Random Resource Values. CoRR abs/2306.12603 (2023) - [i45]Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden:
Collaborative Coalitions in Multi-Agent Systems: Quantifying the Strong Price of Anarchy for Resource Allocation Games. CoRR abs/2308.08045 (2023) - [i41]Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden:
Collaborative Decision-Making and the k-Strong Price of Anarchy in Common Interest Games. CoRR abs/2311.01379 (2023) - 2022
- [j39]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
The Effectiveness of Subsidies and Taxes in Atomic Congestion Games. IEEE Control. Syst. Lett. 6: 614-619 (2022) - [j33]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
The Effectiveness of Subsidies and Tolls in Congestion Games. IEEE Trans. Autom. Control. 67(6): 2729-2742 (2022) - [c76]Bryce L. Ferguson, Daigo Shishika, Jason R. Marden:
Ensuring the Defense of Paths and Perimeters in Dynamic Defender-Attacker Blotto Games (dDAB) on Graphs. Allerton 2022: 1-7 - [c71]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Avoiding Unintended Consequences: How Incentives Aid Information Provisioning in Bayesian Congestion Games. CDC 2022: 3781-3786 - [i40]Austin K. Chen, Bryce L. Ferguson, Daigo Shishika, Michael R. Dorothy, Jason R. Marden, George J. Pappas, Vijay Kumar:
Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information. CoRR abs/2204.04176 (2022) - [i39]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Avoiding Unintended Consequences: How Incentives Aid Information Provisioning in Bayesian Congestion Games. CoRR abs/2204.06046 (2022) - 2021
- [j30]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) - [c66]Bryce L. Ferguson, Jason R. Marden:
The Impact of Fairness on Performance in Congestion Networks. ACC 2021: 4521-4526 - [c64]Bryce L. Ferguson, Jason R. Marden:
Robust Utility Design in Distributed Resource Allocation Problems with Defective Agents. CDC 2021: 1650-1655 - [c62]Yixiao Yue, Bryce L. Ferguson, Jason R. Marden:
Incentive Design for Congestion Games with Unincentivizable Users. CDC 2021: 4515-4520 - [i34]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
The Effectiveness of Subsidies and Tolls in Congestion Games. CoRR abs/2102.09655 (2021) - 2020
- [c59]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Carrots or Sticks? The Effectiveness of Subsidies and Tolls in Congestion Games. ACC 2020: 1853-1858 - [c56]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Carrots or Sticks? The Effectiveness of Subsidies and Tolls in Congestion Games. ACC 2020: 5370-5375 - 2019
- [c50]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Utilizing Information Optimally to Influence Distributed Network Routing. CDC 2019: 5008-5013 - [c46]Rahul Chandan, Dario Paccagnan, Bryce L. Ferguson, Jason R. Marden:
Computing optimal taxes in atomic congestion games. NetEcon@SIGMETRICS 2019: 2:1 - [i17]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Utilizing Information Optimally to Influence Distributed Network Routing. CoRR abs/1907.10172 (2019) - [i14]Bryce L. Ferguson, Philip N. Brown, Jason R. Marden:
Carrots or Sticks? The Effectiveness of Subsidies and Tolls in Congestion Games. CoRR abs/1910.02343 (2019) - [i12]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)
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-09-11 00:35 CEST 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:
