default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarna Pásztor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i8]Matej Jusup, Kenan Zhang, Zhiyuan Hu, Barna Pásztor, Andreas Krause, Francesco Corman:
Ride-Sourcing Vehicle Rebalancing with Service Accessibility Guarantees via Constrained Mean-Field Reinforcement Learning. CoRR abs/2503.24183 (2025)- 2024
- [c5]Matej Jusup, Barna Pásztor, Tadeusz Janik, Kenan Zhang, Francesco Corman, Andreas Krause, Ilija Bogunovic:
Safe Model-Based Multi-Agent Mean-Field Reinforcement Learning. AAMAS 2024: 973-982 - [c4]Barna Pásztor, Parnian Kassraie, Andreas Krause:
Bandits with Preference Feedback: A Stackelberg Game Perspective. NeurIPS 2024 - [c3]Vinzenz Thoma, Barna Pásztor, Andreas Krause, Giorgia Ramponi, Yifan Hu:
Contextual Bilevel Reinforcement Learning for Incentive Alignment. NeurIPS 2024 - [c2]Rakshit Trivedi, Akbir Khan, Jesse Clifton, Lewis Hammond, Edgar A. Duéñez-Guzmán, Dipam Chakraborty, John P. Agapiou, Jayd Matyas, Alexander Sasha Vezhnevets, Barna Pásztor, Yunke Ao, Omar G. Younis, Jiawei Huang, Benjamin Swain, Haoyuan Qin, Mian Deng, Ziwei Deng, Utku Erdoganaras, Yue Zhao, Marko Tesic, Natasha Jaques, Jakob N. Foerster, Vincent Conitzer, José Hernández-Orallo, Dylan Hadfield-Menell, Joel Z. Leibo:
Melting Pot Contest: Charting the Future of Generalized Cooperative Intelligence. NeurIPS 2024 - [i7]Vinzenz Thoma, Barna Pásztor, Andreas Krause, Giorgia Ramponi, Yifan Hu:
Stochastic Bilevel Optimization with Lower-Level Contextual Markov Decision Processes. CoRR abs/2406.01575 (2024) - [i6]Barna Pásztor, Parnian Kassraie, Andreas Krause:
Bandits with Preference Feedback: A Stackelberg Game Perspective. CoRR abs/2406.16745 (2024) - [i5]Paul Friedrich
, Barna Pásztor, Giorgia Ramponi:
Learning Collusion in Episodic, Inventory-Constrained Markets. CoRR abs/2410.18871 (2024) - 2023
- [j1]Barna Pásztor, Andreas Krause, Ilija Bogunovic:
Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning. Trans. Mach. Learn. Res. 2023 (2023) - [i4]Matej Jusup, Barna Pásztor, Tadeusz Janik, Kenan Zhang, Francesco Corman, Andreas Krause, Ilija Bogunovic:
Safe Model-Based Multi-Agent Mean-Field Reinforcement Learning. CoRR abs/2306.17052 (2023) - 2021
- [i3]Barna Pásztor, Ilija Bogunovic, Andreas Krause:
Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning. CoRR abs/2107.04050 (2021) - 2020
- [c1]Katharina Börsig, Ulrik Brandes, Barna Pásztor:
Stochastic Gradient Descent Works Really Well for Stress Minimization. GD 2020: 18-25 - [i2]Katharina Börsig, Ulrik Brandes, Barna Pásztor:
Stochastic Gradient Descent Works Really Well for Stress Minimization. CoRR abs/2008.10376 (2020) - [i1]Metod Jazbec, Barna Pásztor, Felix Faltings, Nino Antulov-Fantulin, Petter N. Kolm:
On the impact of publicly available news and information transfer to financial markets. CoRR abs/2010.12002 (2020)
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 2025-04-22 20:57 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:
