Related papers: The comparative statics of dominance
The quasi-variational inequalities play a significant role in analyzing a wide range of real-world problems. However, these problems are more complicated to solve than variational inequalities as the constraint set is based on the current…
What payoffs are positionally determined for deterministic two-player antagonistic games on finite directed graphs? In this paper we study this question for payoffs that are continuous. The main reason why continuous positionally determined…
The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of…
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.…
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurring on the unguarded vertices by moving there (yielding a new…
Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…
Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…
We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.
While the accuracy-fairness trade-off has been frequently observed in the literature of fair machine learning, rigorous theoretical analyses have been scarce. To demystify this long-standing challenge, this work seeks to develop a…
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized…
In this paper, the existence and uniqueness of strong solutions to distribution dependent neutral SFDEs are proved. We give the conditions such that the order preservation of these equations holds. Moreover, we show these conditions are…
The principle that rational agents should maximize expected utility or choiceworthiness is intuitively plausible in many ordinary cases of decision-making under uncertainty. But it is less plausible in cases of extreme, low-probability risk…
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
We study the classic {\sc Dominating Set} problem with respect to several prominent parameters. Specifically, we present algorithmic results that sidestep time complexity barriers by the incorporation of either approximation or larger…
How do competing populations convert a spatial advantage into macroscopic dominance? We introduce a stochastic model for resource competition that decouples the transient discovery phase from monopolization. Initial symmetry breaking is…
We propose some new results on the comparison of the minimum or maximum order statistic from a random number of non-identical random variables. Under the non-identical set-up, with certain conditions, we prove that random minimum (maximum)…
The range of a payoff function for an $n$-player finite strategic game is investigated using a novel approach, the notion of extreme points of a non-convex set. The shape of a noncooperative payoff region can be estimated using extreme…
We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which…
Non-deterministic measurements are common in real-world scenarios: the performance of a stochastic optimization algorithm or the total reward of a reinforcement learning agent in a chaotic environment are just two examples in which…