Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.14544

Infinite lexicographic products of positional objectives

Antonio Casares·Pierre Ohlmann·Michał Skrzypczak·Igor Walukiewicz
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, TheoretiCS 2023] established that positionality of prefix-independent objectives is preserved by finite lexicographic products. We propose two different notions of infinite lexicographic products indexed by arbitrary ordinals, and extend Ohlmann's result by proving that they also preserve positionality. In the context of one-player positionality, this extends positional determinacy results of [Grädel and Walukiewicz, Logical Methods in Computer Science 2006] to edge-labelled games and arbitrarily many priorities for both Max-Parity and Min-Parity. Moreover, we show that the Max-Parity objectives over countable ordinals are complete for the infinite levels of the difference hierarchy over $Σ^0_2$ and that Min-Parity is complete for the class $Σ^0_3$. We obtain therefore positional languages that are complete for all those levels, as well as new insights about closure under unions and neutral letters.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Casares, Pierre Ohlmann, Michał Skrzypczak, Igor Walukiewicz. 2026-05-11. Infinite lexicographic products of positional objectives. https://arxiv.org/abs/2506.14544

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

KEEP EXPLORING

Related papers

arXiv2026

Dynamic Welfare-Maximizing Pooled Testing

Pooled testing uses one test to certify several agents as healthy when the pooled result is negative. We study a budget-constrained welfare problem in which agents have heterogeneous utilities and independent prior probabilities of being healthy. Welfare is earned when an agent is certified healthy, and a dynamic policy may choose each pool after observing earlier test outcomes. We ask how much such adaptation can improve over a static allocation that fixes all pools in advance. Our main result proves that the optimal dynamic policy has value at most twice that of the optimal static overlapping allocation, for every population, test budget, and pool-size cap. The proof samples a path through the dynamic policy using an independent health profile, randomly thins the selected pools, and compares the resulting static allocation with the dynamic policy one agent at a time. A Boolean-cube argument proves the comparison on uniform subcubes, and a complementary-profile coupling lifts the result to arbitrary heterogeneous product priors. We also identify regimes in which adaptivity has no value, show that strict adaptive gains require re-pooling agents after positive tests, and give a three-agent instance in which adaptation is strictly beneficial. Exact-Joint Greedy obtains a $1/(e+1)$ fraction of optimal static overlapping welfare. The static non-overlapping Greedy algorithm of Finster et al. has the same guarantee, hence our factor-two theorem newly implies that each is a $2(e+1)$-approximation to the optimal dynamic policy. Finally, a reproducible exact small-instance study compares the dynamic and static benchmarks and greedy policies. The appendix records separate exploratory results for Gibbs-marginal and reinforcement-learning approaches at larger scales.

cs.GT↗
arXiv2026

Induced Representations in Cooperative Games with Homogeneous Groups of Players

Oftentimes, the Shapley value, a measure of the contribution of a player to a game, becomes infeasible for games with many players. However, establishing symmetry allows for polynomial-time computation. To examine this reduction, we identify the spectrum of a homogeneous group game by using an induced representation from a Young subgroup. We prove that the depth of interaction of a two-group game is limited by the size of the minority group. Therefore, the algebraic structure of the game filters out a large space of irrelevant complexities. We then show that this filtration constrains any symmetric linear value to a specific subspace. This recovers the Shapley value uniquely for games consisting of exactly two homogeneous groups under standard axioms. Finally, we explore applications to the UN Security Council and complementary goods markets to illustrate the practical power of this approach.

cs.GT↗
arXiv2026

From Bilateral Trade to Matching Markets: Sharp Gains from Trade

We study gains from trade in matching markets with independent private values and costs, Bayesian incentive compatibility, interim individual rationality, and no expected budget deficit. A second-best guarantee for finite bilateral trade extends without loss to matching markets with independent Borel priors, arbitrary downward-closed feasibility, and finite expected first-best gains. For bounded buyers with monotone hazard rates and arbitrary bounded sellers, we determine the exact worst-case ratio of second-best to first-best gains, approximately $0.72490721$. For binary buyers and sellers with at most $m$ types, we determine the exact ratio for every $m$, including $8/9$ when $m=2$ and a limit of $4/5$ as $m$ grows. Both families of bounds are tight already in bilateral trade.

cs.GT↗