Related papers: On Locally Rationalizable Social Choice Functions
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences. We…
We give a structure theorem for all coalitionally strategy-proof social choice functions whose range is a subset of cardinality two of a given larger set of alternatives. We provide this in the case where the voters/agents are allowed to…
We introduce local iterated function systems and present some of their basic properties. A new class of local attractors of local iterated function systems, namely local fractal functions, is constructed. We derive formulas so that these…
We consider the problem of topological linearization of smooth (C infinity or real analytic) control systems, i.e. of their local equivalence to a linear controllable system via point-wise transformations on the state and the control…
Understanding how biological organisms make decisions is of fundamental importance in understanding behavior. Such an understanding within evolutionary game theory so far has been sought by appealing to bounded rationality. Here, we present…
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…
In coalitional games, a player $i$ is regarded as strictly more desirable than player $j$ if substituting $j$ with $i$ within any coalition leads to a strict augmentation in the value of certain coalitions, while preserving the value of the…
Inthispaperwedescribeaconcept-wisemulti-preferencesemantics for description logic which has its root in the preferential approach for modeling defeasible reasoning in knowledge representation. We argue that this proposal, beside satisfying…
This study proposes a tractable stochastic choice model to identify motivations for prosocial behavior, and to explore alternative motivations of deliberate randomization beyond ex-ante fairness concerns. To represent social preferences, we…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
A broad range of on-line behaviors are mediated by interfaces in which people make choices among sets of options. A rich and growing line of work in the behavioral sciences indicate that human choices follow not only from the utility of…
In a context where a decision has to be taken collectively by several agents, the social choice problem consists in deciding whether there exists a socially acceptable rule that aggregates the individual preferences of the agents into a…
Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…
We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18]. The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude…
We explore a definition of complexity based on logic functions, which are widely used as compact descriptions of rules in diverse fields of contemporary science. Detailed numerical analysis shows that (i) logic complexity is effective in…
Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…
The self-rationalising capabilities of LLMs are appealing because the generated explanations can give insights into the plausibility of the predictions. However, how faithful the explanations are to the predictions is questionable, raising…
We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…
Explanations are well-known to improve recommender systems' transparency. These explanations may be local, explaining an individual recommendation, or global, explaining the recommender model in general. Despite their widespread use, there…
We introduce the notion of Local Computation Mechanism Design - designing game theoretic mechanisms which run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the…