![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Devansh Jalota
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j4]Devansh Jalota
, Kiril Solovey
, Karthik Gopalakrishnan
, Stephen Zoepf
, Hamsa Balakrishnan
, Marco Pavone
:
When Efficiency Meets Equity in Congestion Pricing and Revenue Refunding Schemes. IEEE Trans. Control. Netw. Syst. 11(2): 1127-1138 (2024) - 2023
- [j3]Devansh Jalota, Kiril Solovey, Matthew Tsao, Stephen Zoepf, Marco Pavone
:
Balancing fairness and efficiency in traffic routing via interpolated traffic assignment. Auton. Agents Multi Agent Syst. 37(2): 32 (2023) - [j2]Devansh Jalota
, Marco Pavone
, Qi Qi
, Yinyu Ye:
Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms. Games Econ. Behav. 141: 223-260 (2023) - [j1]Devansh Jalota
, Dario Paccagnan, Maximilian Schiffer
, Marco Pavone
:
Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements. INFORMS J. Comput. 35(3): 560-577 (2023)
Conference and Workshop Papers
- 2023
- [c7]Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan, Ramesh Johari, Marco Pavone:
Online Learning for Traffic Routing under Unknown Preferences. AISTATS 2023: 3210-3229 - [c6]Devansh Jalota, Jessica Lazarus, Alexandre M. Bayen, Marco Pavone
:
Credit-Based Congestion Pricing: Equilibrium Properties and Optimal Scheme Design. CDC 2023: 4124-4129 - [c5]Devansh Jalota, Haoyuan Sun, Navid Azizan
:
Online Learning for Equilibrium Pricing in Markets under Incomplete Information. CDC 2023: 4996-5001 - 2022
- [c4]Devansh Jalota, Kiril Solovey, Matthew Tsao, Stephen Zoepf, Marco Pavone:
Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment. AAMAS 2022: 678-686 - [c3]Devansh Jalota:
Incentive Design for Equitable Resource Allocation: Artificial Currencies and Allocation Constraints. AAMAS 2022: 1846-1848 - 2021
- [c2]Devansh Jalota, Kiril Solovey, Karthik Gopalakrishnan, Stephen Zoepf, Hamsa Balakrishnan, Marco Pavone:
When Efficiency meets Equity in Congestion Pricing and Revenue Refunding Schemes. EAAMO 2021: 9:1-9:11 - 2020
- [c1]Devansh Jalota, Marco Pavone, Qi Qi, Yinyu Ye:
Markets for Efficient Public Good Allocation with Social Distancing. WINE 2020: 102-116
Informal and Other Publications
- 2024
- [i14]Devansh Jalota, Michael Ostrovsky, Marco Pavone:
When Simple is Near-Optimal in Security Games. CoRR abs/2402.11209 (2024) - [i13]Devansh Jalota, Matthew Tsao, Marco Pavone:
Catch Me If You Can: Combatting Fraud in Artificial Currency Based Government Benefits Programs. CoRR abs/2402.16162 (2024) - [i12]Damien Berriaud, Ezzat Elokda, Devansh Jalota, Emilio Frazzoli, Marco Pavone, Florian Dörfler:
To Spend or to Gain: Online Learning in Repeated Karma Auctions. CoRR abs/2403.04057 (2024) - [i11]Chih-Yuan Chiu, Devansh Jalota, Marco Pavone:
Credit vs. Discount-Based Congestion Pricing: A Comparison Study. CoRR abs/2403.13923 (2024) - 2023
- [i10]Devansh Jalota, Haoyuan Sun, Navid Azizan
:
Online Learning for Equilibrium Pricing in Markets under Incomplete Information. CoRR abs/2303.11522 (2023) - 2022
- [i9]Devansh Jalota:
Matching with Transfers under Distributional Constraints. CoRR abs/2202.05232 (2022) - [i8]Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan
, Ramesh Johari, Marco Pavone:
Online Learning for Traffic Routing under Unknown Preferences. CoRR abs/2203.17150 (2022) - [i7]Devansh Jalota, Yinyu Ye:
Online Learning in Fisher Markets with Unknown Agent Preferences. CoRR abs/2205.00825 (2022) - [i6]Devansh Jalota, Jessica Lazarus, Alexandre M. Bayen, Marco Pavone:
Credit-Based Congestion Pricing: Equilibrium Properties and Optimal Scheme Design. CoRR abs/2210.15907 (2022) - 2021
- [i5]Devansh Jalota, Kiril Solovey, Stephen Zoepf, Marco Pavone:
Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment. CoRR abs/2104.00098 (2021) - [i4]Devansh Jalota, Kiril Solovey, Karthik Gopalakrishnan, Stephen Zoepf, Hamsa Balakrishnan, Marco Pavone:
When Efficiency meets Equity in Congestion Pricing and Revenue Refunding Schemes. CoRR abs/2106.10407 (2021) - [i3]Devansh Jalota, Marco Pavone, Qi Qi, Yinyu Ye:
Fisher Markets with Linear Constraints: Equilibrium Properties and Efficient Distributed Algorithms. CoRR abs/2106.10412 (2021) - [i2]Devansh Jalota, Dario Paccagnan, Maximilian Schiffer, Marco Pavone:
Online Traffic Routing: Deterministic Limits and Data-driven Enhancements. CoRR abs/2109.08706 (2021) - 2020
- [i1]Devansh Jalota, Marco Pavone, Yinyu Ye:
Markets for Efficient Public Good Allocation. CoRR abs/2005.10765 (2020)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint