Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jakub Bielawski

dblp:118/8574 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2021
0000-0001-6816-4501ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › learning in games
learning dynamics
0.512021
Follow-the-Regularized-Leader Routes to Chaos in Routing Games · ICML 2021
Algorithmic game theory and mechanism design › congestion games
selfish routing
0.512021
Follow-the-Regularized-Leader Routes to Chaos in Routing Games · ICML 2021
Algorithmic game theory and mechanism design
congestion games
0.112021
Follow-the-Regularized-Leader Routes to Chaos in Routing Games · ICML 2021

Methods — techniques the papers use, named apart from their topics

multiplicative weights update · 0.5follow-the-regularized-leader · 0.5chaos theory · 0.5
YearPublicationVenuePosition
2021 Follow-the-Regularized-Leader Routes to Chaos in Routing Games
abstract
We study the emergence of chaotic behavior of Follow-the-Regularized Leader (FoReL) dynamics in games. We focus on the effects of increasing the population size or the scale of costs in congestion games, and generalize recent results on unstable, chaotic behaviors in the Multiplicative Weights Update dynamics to a much larger class of FoReL dynamics. We establish that, even in simple linear non-atomic congestion games with two parallel links and \emph{any} fixed learning rate, unless the game is fully symmetric, increasing the population size or the scale of costs causes learning dynamics to becomes unstable and eventually chaotic, in the sense of Li-Yorke and positive topological entropy. Furthermore, we prove the existence of novel non-standard phenomena such as the coexistence of stable Nash equilibria and chaos in the same game. We also observe the simultaneous creation of a chaotic attractor as another chaotic attractor gets destroyed. Lastly, although FoReL dynamics can be strange and non-equilibrating, we prove that the time average still converges to an \emph{exact} equilibrium for any choice of learning rate and any scale of costs.
Jakub Bielawski, Thiparat Chotibut, Fryderyk Falniowski, Grzegorz Kosiorowski, Michal Misiurewicz, Georgios Piliouras
ICML1
2021 Convex hull of a fuzzy set and triangular norms
abstract
The t-norm fuzzy sets is a class of fuzzy sets equipped with a pair of algebraic operation, a notion of T-convexity and a metric, where all these notions are based on a strict triangular norm T. In this paper we introduce in this class a notion of T-convex hull of a fuzzy set. We prove theorem that binds the T-convex hull of an upper semicontinuous fuzzy set with the convex hull of a (crisp) set. We further show two applications of this result. First, we prove that the operation of forming T-convex hull behaves well with respect to algebraic operations. Second, we show an analogue of Shapley-Folkman theorem. Shapley-Folkman theorem is a well-known result that provides an upper bound on the distance between Minkowski sum of sets and the convex hull of this sum. In this paper we show that the distance between the sum of upper semicontinuous fuzzy subsets of a finite dimensional Euclidean space and the T-convex hull of this sum has an upper bound. As a consequence of this result, we present an iterative procedure for forming T-convex hull of an upper semicontinuous fuzzy set. As an application of the results regarding t-norm fuzzy sets we show an example from a game theoretic setting, where t-norm fuzzy sets were used to handle uncertainty in a repeated two player game.
Jakub Bielawski, Jacek Tabor
Fuzzy Sets Syst.1
2012 A t-norm embedding theorem for fuzzy sets
Jakub Bielawski, Jacek Tabor
Fuzzy Sets Syst.1