Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.19964

Identity-Truthful Online Decision-Making

Tomer Ezra·Adar Kantor
View original source ↗Read source document ↗Export metadata ↓

Abstract

In Bayesian online selection, a decision-maker observes a sequence of stochastic rewards and must immediately and irrevocably accept or reject each realized value. The rewards come from known distributions, referred to as their identities. Whereas classical prophet inequalities compare online algorithms to the offline optimum, recent work studies information gaps relative to the optimal online algorithm, which knows the identities' arrival order. We introduce a new restriction motivated by identity-independent decision-making: the decision-maker observes the current value but learns its identity only after deciding whether to accept it. We call such algorithms identity-truthful. We define the identity-truthfulness gap as the optimal worst-case approximation achievable by identity-truthful algorithms relative to the optimal online benchmark. This gap lies between the order-competitive ratio [Ezra et al. 2023] and the identity-blindness gap [Ezra et al. 2024]. We design an algorithm establishing that the identity-truthfulness gap is strictly greater than $0.5$, thereby separating it from the identity-blindness gap, which is exactly $0.5$. We complement this result with an upper bound of $0.81$ on the identity-truthfulness gap, which is strictly lower than the known upper bound of $0.829$ on the order-competitive ratio [Chen et al. 2024]. Finally, we study the relationship between identity-truthful algorithms and pricing mechanisms. Motivated by questions on the power of posted prices in prophet inequalities [Duetting et al. 2020], we show that identity-truthfulness breaks the usual connection between online algorithms and pricing: there exists an instance for which the optimal identity-truthful algorithm cannot be implemented by any pricing mechanism.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Tomer Ezra, Adar Kantor. 2026-07-22. Identity-Truthful Online Decision-Making. https://arxiv.org/abs/2607.19964

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗