Related papers: The Communication Complexity of Payment Computatio…

The incentive-compatibility properties of blockchain transaction fee mechanisms have been investigated with *passive* block producers that are motivated purely by the net rewards earned at the consensus layer. This paper introduces a model…

Many smart grid frameworks, such as demand response programs, require accurate information about consumers' parameters (e.g., flexibility) at the aggregator side to optimize grid operations. Existing works typically rely on perfect…

Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…

We study the communication complexity of welfare maximization in combinatorial auctions with $m$ items and two subadditive bidders. A $\frac{1}{2}$-approximation can be guaranteed by a trivial randomized protocol with zero communication, or…

We prove an impossibility result for conditional Probably Approximately Correct (PAC)-efficient reasoning in large language models. While recent work has established marginal PAC efficiency guarantees for composite models that switch…

Modern data aggregation often involves a platform collecting data from a network of users with various privacy options. Platforms must solve the problem of how to allocate incentives to users to convince them to share their data. This paper…

Economic complexity algorithms aim to uncover the hidden capabilities that drive economic systems. Here, we present a fundamental reinterpretation of two of these algorithms, the Economic Complexity Index (ECI) and the Economic Fitness and…

Existing research on fairness-aware recommendation has mainly focused on the quantification of fairness and the development of fair recommendation models, neither of which studies a more substantial problem--identifying the underlying…

Let f subset of X x Y x Z be a relation. Let the public coin one-way communication complexity of f, with worst case error 1/3, be denoted R^{1,pub}_{1/3}(f). We show that if for computing f^k (k independent copies of f), o(k…

\textit{Fair division} of resources among competing agents is a fundamental problem in computational social choice and economic game theory. It has been intensively studied on various kinds of items (\textit{divisible} and…

This paper studies the master-worker distributed linearly separable computation problem, where the considered computation task, referred to as linearly separable function, is a typical linear transform model widely used in cooperative…

We show that the deterministic decision tree complexity of a (partial) function or relation $f$ lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation $f \circ g$ as long as the gadget $g$…

Semantic communication (SC) is recognized as a promising approach for enabling reliable communication with minimal data transfer while maintaining seamless connectivity for a group of wireless users. Unlocking the advantages of SC for…

We initiate the study of congestion games with variable demands where the (variable) demand has to be assigned to exactly one subset of resources. The players' incentives to use higher demands are stimulated by non-decreasing and concave…

$\newcommand{\F}{\mathbb{F}}$We study the Boolean function parameters sensitivity ($s$), block sensitivity ($bs$), and alternation ($alt$) under specially designed affine transforms. For a function $f:\F_2^n\to \{0,1\}$, and $A=Mx+b$ for $M…

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…

Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in…

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

We study a syntax for specifying quantitative "assertions" - functions mapping program states to numbers - for probabilistic program verification. We prove that our syntax is expressive in the following sense: Given any probabilistic…

Counterfactual explanations (CFEs) highlight what changes to a model's input would have changed its prediction in a particular way. CFEs have gained considerable traction as a psychologically grounded solution for explainable artificial…