default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBary S. R. Pradelski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Jean-Paul Carvalho
, Bary S. R. Pradelski, Cole Williams:
Intersectionality: Affirmative Action with Multidimensional Identities. Manag. Sci. 71(5): 4495-4509 (2025)- [j7]Martin Bichler, Davide Legacci, Panayotis Mertikopoulos, Matthias Oberlechner, Bary S. R. Pradelski:
Characterizing the Convergence of Game Dynamics via Potentialness. Trans. Mach. Learn. Res. 2025 (2025) - [c13]Simon Finster, Patrick Loiseau, Simon Mauras, Mathieu Molina, Bary S. R. Pradelski:
Equitable Auctions. EC 2025: 304 - [c12]Bary S. R. Pradelski, Bassel Tarbush:
Satisficing Equilibrium. EC 2025: 442 - [i12]Bary S. R. Pradelski, Bassel Tarbush:
Pure ε-equilibrium in random games. CoRR abs/2502.07585 (2025) - [i11]Martin Bichler, Davide Legacci, Panayotis Mertikopoulos, Matthias Oberlechner, Bary S. R. Pradelski:
Characterizing the Convergence of Game Dynamics via Potentialness. CoRR abs/2503.16285 (2025) - [i10]Rémi Castera, Patrick Loiseau, Bary S. R. Pradelski:
Correlation of Rankings in Matching Markets. CoRR abs/2512.05304 (2025) - 2024
- [c11]Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden:
Bridging the Gap Between Central and Local Decision-Making: The Efficacy of Collaborative Equilibria in Altruistic Congestion Games. CDC 2024: 5373-5378 - [c10]Davide Legacci, Panayotis Mertikopoulos, Bary S. R. Pradelski:
A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential Weights. ICML 2024 - [c9]Davide Legacci, Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras, Bary S. R. Pradelski:
No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests. NeurIPS 2024 - [i9]Simon Finster, Patrick Loiseau, Simon Mauras, Mathieu Molina, Bary S. R. Pradelski:
Equitable Pricing in Auctions. CoRR abs/2403.07799 (2024) - [i8]Davide Legacci, Panayotis Mertikopoulos, Bary S. R. Pradelski:
A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights. CoRR abs/2405.07224 (2024) - [i7]Bary S. R. Pradelski, Bassel Tarbush:
Satisficing Equilibrium. CoRR abs/2409.00832 (2024) - [i6]Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden:
Bridging the Gap Between Central and Local Decision-Making: The Efficacy of Collaborative Equilibria in Altruistic Congestion Games. CoRR abs/2409.01525 (2024) - [i5]Davide Legacci, Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras, Bary S. R. Pradelski:
No-regret learning in harmonic games: Extrapolation in the face of conflicting interests. CoRR abs/2412.20203 (2024) - 2023
- [j6]Bary S. R. Pradelski:
Social influence: The Usage History heuristic. Math. Soc. Sci. 123: 105-113 (2023) - [c8]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 - [i4]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) - [i3]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
- [c7]Anay Mehrotra, Bary S. R. Pradelski, Nisheeth K. Vishnoi:
Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints. FAccT 2022: 599-609 - [c6]Rémi Castera, Patrick Loiseau, Bary S. R. Pradelski:
Statistical Discrimination in Stable Matchings. EC 2022: 373-374 - [c5]Simon Jantschgi, Heinrich H. Nax, Bary S. R. Pradelski, Marek Pycia:
Double Auctions and Transaction Costs. EC 2022: 847 - [i2]Anay Mehrotra, Bary S. R. Pradelski, Nisheeth K. Vishnoi:
Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints. CoRR abs/2202.01661 (2022) - 2021
- [j5]Jacob D. Leshno, Bary S. R. Pradelski:
The importance of memory for price discovery in decentralized markets. Games Econ. Behav. 125: 62-78 (2021) - 2020
- [j4]Bary S. R. Pradelski, Heinrich H. Nax:
Market sentiments and convergence dynamics in decentralized assignment economies. Int. J. Game Theory 49(1): 275-298 (2020) - [c4]Panayotis Mertikopoulos, Heinrich H. Nax, Bary S. R. Pradelski:
Quick or Cheap? Breaking Points in Dynamic Markets. EC 2020: 877-878 - [i1]Panayotis Mertikopoulos, Heinrich H. Nax, Bary S. R. Pradelski:
Quick or cheap? Breaking points in dynamic markets. CoRR abs/2001.00468 (2020)
2010 – 2019
- 2019
- [c3]Bary S. R. Pradelski:
Control by social influence: durables vs. non-durables. CDC 2019: 3478-3483 - [e1]Brendan Lucier, Bary S. R. Pradelski, Bruno Tuffin:
Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation, NetEcon@SIGMETRICS 2019, Phoenix, Arizona, USA, June 28, 2019. ACM 2019, ISBN 978-1-4503-6837-7 [contents] - 2016
- [j3]Heinrich H. Nax, Bary S. R. Pradelski:
Core Stability and Core Selection in a Decentralized Labor Matching Market. Games 7(2): 10 (2016) - 2015
- [j2]Heinrich H. Nax, Bary S. R. Pradelski:
Evolutionary dynamics and equitable core selection in assignment games. Int. J. Game Theory 44(4): 903-932 (2015) - [c2]Bary S. R. Pradelski:
Decentralized Dynamics and Fast Convergence in the Assignment Game: Extended Abstract. EC 2015: 43 - 2013
- [c1]Heinrich H. Nax, Bary S. R. Pradelski, H. Peyton Young:
Decentralized dynamics to optimal and stable states in the assignment game. CDC 2013: 2391-2397 - 2012
- [j1]Bary S. R. Pradelski, H. Peyton Young:
Learning efficient Nash equilibria in distributed systems. Games Econ. Behav. 75(2): 882-897 (2012)
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 2026-01-25 00:12 CET 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:
