Related papers: Strategy-proofness on the Non-Paretian Subdomain

In this paper, we study a parameter that is squeezed between arguably the two important domination parameters, namely the domination number, $\gamma(G)$, and the total domination number, $\gamma_t(G)$. A set $S$ of vertices in $G$ is a…

Designing two-sided matching mechanisms is challenging when practical demands for matching outcomes are difficult to formalize and the designed mechanism must satisfy theoretical conditions. To address this, prior work has proposed a…

We study the existence of pairwise stable allocations in matching markets with contracts and propose a domain restriction that guarantees their existence. Specifically, we define pseudo-substitutable preferences, a domain that strictly…

A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of…

We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing…

We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most…

We consider the problem of estimating `preference' or `strength' parameters in three-way comparison experiments, each composed of a series of paired comparisons, but where only the single `preferred' or `strongest' candidate is known in…

A graph is well-dominated if all its minimal dominating sets have the same cardinality. In this paper we prove that at least one factor of every connected, well-dominated Cartesian product is a complete graph, which then allows us to give a…

We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The \emph{semitotal domination number}, $\gamma_{t2}(G)$, is the…

We consider an economic environment with one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ refers to the winning probability of an object, and $t$ denotes the payment that the buyer makes. We consider…

Off-policy learning in dynamic decision problems is essential for providing strong evidence that a new policy is better than the one in use. But how can we prove superiority without testing the new policy? To answer this question, we…

In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ has…

We study online temporal voting, where a group of voters submit 0/1 approvals on sets of alternatives that arrive online over multiple rounds and a single alternative is chosen in each round. We introduce online variants of two well-known…

Strategy-proofness is a fundamental desideratum in mechanism design, ensuring truthful reporting and robust participation. Stability is another central requirement in matching markets, widely adopted in applications such as school choice…

An assembly of $n$ voters needs to decide on $t$ independent binary issues. Each voter has opinions about the issues, given by a $t$-bit vector. Anscombe's paradox shows that a policy following the majority opinion in each issue may not…

Several of the classical results in social choice theory demonstrate that in order for many voting systems to be well-behaved the set domain of individual preferences must satisfy some kind of restriction, such as being single-peaked on a…

A deterministic system of interacting agents is considered as a model for economic dynamics. The dynamics of the system is described by a coupled map lattice with near neighbor interactions. The evolution of each agent results from the…

The one-dimensional deterministic economic model recently studied by Gonzalez-Estevez et al. [Physica A 387, 4367 (2008)] is considered on a two-dimensional square lattice with periodic boundary conditions. In this model, the evolution of…

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…