This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

Graph theory, a fundamental branch of mathematics, centers on the study of networks
composed of vertices (nodes) and edges, examining their paths, structures, and properties …

We investigate how robust are results of committee elections to small changes in the input
preference orders, depending on the voting rules used. We find that for typical rules the …

We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …

In this paper, an asymmetrical congestion game is used to build a fairness concern‐based
coordinated route guidance model for alleviating traffic congestion. Coordinated vehicle …

A polymatrix game is a multi-player game over n players, where each player chooses a pure
strategy from a list of its own pure strategies. The utility of each player is a sum of payoffs it …

This paper describes an algorithm for calculating approximately mixed Nash equilibria (NE)
in bimatrix games. The algorithm fuzzifies the strategies with normalized possibility …

We investigate the difficulty of finding economically efficient solutions to coordination
problems on graphs. Our work focuses on two forms of coordination problem: pure …

We provide a complete characterization for the computational complexity of finding
approximate equilibria in two-action graphical games. We consider the two most well …

This paper studies constrained approximate Nash equilibria in polymatrix games. We show
that is NP-hard to decide if a polymatrix game has a constrained approximate equilibrium for …