Related papers: Incompleteness, Independence, and Negative Dominan…

We study the robustness of Bayesian persuasion to uncertainty about the receiver's preferences. We analyze two conceptually distinct notions: continuity, in which only the modeler lacks precise knowledge, but where the model's predictions…

This work considers reasons for and implications of discarding the assumption of transitivity, which (transitivity) is the fundamental postulate in the utility theory of Von Neumann and Morgenstern, the adiabatic accessibility principle of…

In the gambling foundation of probability theory, rationality requires that a subject should always (never) find desirable all nonnegative (negative) gambles, because no matter the result of the experiment the subject never (always)…

The desirable gambles framework provides a foundational approach to imprecise probability theory but relies heavily on linear utility assumptions. This paper introduces function-coherent gambles, a generalization that accommodates…

Existing observational approaches for learning human preferences, such as inverse reinforcement learning, usually make strong assumptions about the observability of the human's environment. However, in reality, people make many important…

Intransitive dice $D^{(1)}, \ldots, D^{(\ell)}$ are dice such that $D^{(1)}$ has advantage when played against $D^{(2)}$, dice $D^{(2)}$ has advantage when played against $D^{(3)}$ and so on, up to $D^{(\ell)}$, which has advantage over…

The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

I generalize a theorem of Predd, et al.~(2009) on domination and strictly proper scoring rules to the case of non-additive scoring rules.

The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…

Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

This paper studies the topic of cost-efficiency in incomplete markets. A payoff is called cost-efficient if it achieves a given probability distribution at some given investment horizon with a minimum initial budget. Extensive literature…

We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not able to clearly determine who they should approve or…

We investigate a voting scenario with two groups of agents whose preferences depend on a ground truth that cannot be directly observed. The majority's preferences align with the ground truth, while the minorities disagree. Focusing on…

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$.…

Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…

Commutativity is a normative criterion of aggregation and updating stating that the aggregation of expert posteriors should be identical to the update of the aggregated priors. I propose a thought experiment that raises questions about the…

Inertia and context-dependent choice effects are well-studied classes of behavioural phenomena. While much is known about these effects in isolation, little is known about whether one of them "dominates" the other when both can potentially…

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1]…