Searcharxiv⌕ Search

arXiv · 2611.04686

Designing AI-Mediated Communication in Teams

Abstract

AI assistants increasingly participate in work that requires employees to exchange information and coordinate decisions. We study how a firm should design this communication when workers' interests conflict with each other's and the firm's. Two workers privately know local conditions and their preferred responses, while the assistant knows aggregate project conditions. The firm discloses project information before workers report and choose their own actions. Transparency improves adaptation but can undermine truthful preference reporting. When workers agree with the firm on the productive direction, coarsening project information under weak coordination can preserve useful preference reporting at a cost in forecast precision. Under strong coordination, the firm instead prefers full project disclosure and factual reports, because preference information induces costly accommodation of private objectives. Under weak coordination, a firm-optimal policy can leave workers worse off than direct exchange; requiring their acceptance can call for further coarsening. Releasing project context after reports can sustain factual communication that early release would prevent. With separate delivery decisions that cannot be revised jointly, endogenous forwarding weakly improves firm-preferred performance over unchanged forwarding and strictly improves it in some environments. Numerical comparisons show that full initial disclosure captures most gains in the aligned environments considered, while further design has greater value when workers can favor opposing directions. The results distinguish the credibility of employees' reports from their organizational value and show how disclosure timing affects both.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wichinpong Park Sinchaisri, Zhiwei Wang. 2026-11-03. Designing AI-Mediated Communication in Teams. https://arxiv.org/abs/2611.04686

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

KEEP EXPLORING

Related papers

Project Submission Games in Participatory Budgeting

We introduce the framework of project submission games, capturing the behavior of project proposers in participatory budgeting (and multiwinner elections). Here, each proposer submits a subset of project proposals, aiming at maximizing the total cost of those that get funded. We focus on finding conditions under which pure Nash equilibria (NE) exist in our games, and on the complexity of checking whether they exist. We also seek algorithms for computing best responses for the proposers

cs.GT↗

Domination-Avoiding Learning Agents Cannot Collude

An influential paper of Calvano et al. empirically demonstrated that Q-learning agents spontaneously collude when placed as sellers that compete on prices in a natural market model. More recent results of Fish et al. empirically demonstrated that similar collusion happens with commercial LLMs. We formally prove that such collusion can also happen with external-regret-minimizing agents. We identify a very general class of agents, which we term Domination-Avoiding agents, that provably do not collude in such markets. This class contains all Mean-Based agents and all internal-regret-minimizing agents, as well as others such as Multiplicative-Weight agents with variable learning rate and contextual variants thereof. More generally we show that, in any game, this class of agents is guaranteed to jointly learn to almost never play strategies that are eliminated by repeated elimination of purely dominated strategies.

cs.GT↗

Settling the Complexity of Hylland--Zeckhauser Equilibria

The Hylland--Zeckhauser (HZ) mechanism is a foundational framework for allocating indivisible goods in one-sided matching markets via lotteries supported by competitive prices and equal artificial budgets. We resolve the exact computational complexity of the HZ scheme by proving that computing an exact HZ equilibrium is FIXP-complete, thereby settling a conjecture of Vazirani and Yannakakis. Notably, this hardness persists even when computing the equilibrium allocation alone. We establish our hardness result via a reduction that encodes quadratic fixed-point equations into a reciprocal variational inequality. On the algorithmic side, we present a deterministic polynomial-time approximation algorithm that achieves an additive error of $0.0755211 + δ$ for any $δ> 0$, significantly improving upon the previous $1/e$ guarantee.

cs.GT↗