Fryderyk Falniowski

TL;DR: In this article, the connections between entropy, chaos, and independence in topological dynamics were surveyed and extensions of two classical results placing the following notions in the context of symbolic dynamics were presented.

TL;DR: In this paper, a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm is considered and a twoparameter family of maps of the unit square to itself is obtained.

TL;DR: This work considers the concept of generalized Kolmogorov–Sinai entropy, where instead of the Shannon entropy function, this function is considered an arbitrary concave function defined on the unit interval, vanishing in the origin.

TL;DR: A stress test for classic routing games with arbitrarily many strategies, polynomial cost functions, non-atomic as well as atomic routing games and heteregenous users shows that every system has a carrying capacity, above which it becomes unstable.

TL;DR: In this article, the authors introduce a new class of generalized measures of relative deprivation, which takes the form of a power mean of order p, and is capable of accommodating both a decreasing weight (the case of p > 1 ), and an increasing weight ( the case of ε ∈ ( 0, 1 ) ) accorded to given changes in the incomes of the individuals who are wealthier than the reference individual, depending on their proximity in the income distribution.