How to pick your football team

Bhargav Narayanan

Home/Archive/arXiv

arXiv · 2605.04034

How to pick your football team

Bhargav Narayanan

View original source ↗Read source document ↗Export metadata ↓

Abstract

Team captains Alice and Bob divide up $2m$ footballers, each reduced to a real-valued score, into two teams of $m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer. Alice starts as picker, Bob as chooser, and roles alternate. The game ends as soon as either captain has a full team of $m$ footballers, at which point the other team receives all remaining footballers. The team with the larger sum of scores wins. Settling a problem raised by Eccles in 2015, we show that Alice cannot win.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Bhargav Narayanan. 2026-05-05. How to pick your football team. https://arxiv.org/abs/2605.04034

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

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗

arXiv2026

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO↗

arXiv2026

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO↗