A universal construction generating potential games

Strategic games are considered where each player's total utility is the sum of local utilities obtained from the use of certain "facilities." All players using a facility obtain the same utility therefrom, which may depend on the identities of users and on their behavior. If a regularity condition is satisfied by every facility, then the game admits an exact potential; both congestion games and games with structured utilities are included in the class and satisfy that condition. Under additional assumptions the potential attains its maximum, which is a Nash equilibrium of the game

‘Super disabilities’ vs ‘Disabilities’?:Theorizing the role of ableism in (mis)representational mythology of disability in the marketplace

People with disabilities (PWD) constitute one of the largest minority groups with one in five people worldwide having a disability. While recognition and inclusion of this group in the marketplace has seen improvement, the effects of (mis)representation of PWD in shaping the discourse on fostering marketplace inclusion of socially marginalized consumers remain little understood. Although effects of misrepresentation (e.g., idealized, exoticized or selective representation) on inclusion/exclusion perceptions and cognitions has received attention in the context of ethnic/racial groups, the world of disability has been largely neglected. By extending the theory of ableism into the context of PWD representation and applying it to the analysis of the We’re the Superhumans advertisement developed for the Rio 2016 Paralympic Games, this paper examines the relationship between the (mis)representation and the inclusion/exclusion discourse. By uncovering that PWD misrepresentations can partially mask and/or redress the root causes of exclusion experienced by PWD in their lived realities, it contributes to the research agenda on the transformative role of consumption cultures perpetuating harmful, exclusionary social perceptions of marginalized groups versus contributing to advancement of their inclusion

Uniformity, Universality, and Computability Theory

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalb\'an, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional uniformity hypothesis, we can answer many questions concerning how countable groups, probability measures, the subset relation, and increasing unions interact with universality. For many natural classes of countable Borel equivalence relations, we can also classify exactly which are uniformly universal. We also show the existence of refinements of Martin's ultrafilter on Turing invariant Borel sets to the invariant Borel sets of equivalence relations that are much finer than Turing equivalence. For example, we construct such an ultrafilter for the orbit equivalence relation of the shift action of the free group on countably many generators. These ultrafilters imply a number of structural properties for these equivalence relations.Comment: 61 Page

Learning-Based Synthesis of Safety Controllers

We propose a machine learning framework to synthesize reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration, two-player games over (potentially) infinite graphs. Our framework targets safety games with infinitely many vertices, but it is also applicable to safety games over finite graphs whose size is too prohibitive for conventional synthesis techniques. The learning takes place in a feedback loop between a teacher component, which can reason symbolically about the safety game, and a learning algorithm, which successively learns an overapproximation of the winning region from various kinds of examples provided by the teacher. We develop a novel decision tree learning algorithm for this setting and show that our algorithm is guaranteed to converge to a reactive safety controller if a suitable overapproximation of the winning region can be expressed as a decision tree. Finally, we empirically compare the performance of a prototype implementation to existing approaches, which are based on constraint solving and automata learning, respectively