Tootfinder

Tournament Robustness via Redundancy
Klim Efremenko, Hendrik Molter, Meirav Zehavi
https://arxiv.org/abs/2506.03701 https://arxiv.org…

Tournament Robustness via Redundancy
A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names. The players participating in the tournament are assigned to the seed positions. In each round, the two players assigned to leaves of the tournament tree with a common parent compete, and the winner is promoted to the parent. The last remaining player is the winner of the tournament. In this work, we study the probl…

If Uzbekistan wins or ties today against UAE, they will - for the first time ever - have qualified for the FIFA world cup final tournament!
If not they still have a path to the final tournament, but it gets messy.
#fifa2026 #worldcup #uzb

This https://arxiv.org/abs/2210.17371 has been replaced.
link: https://scholar.google.com/scholar?q=a

Partitioning a tournament into sub-tournaments of high connectivity
We prove that there exists a constant $c > 0$ such that the vertices of every strongly $c \cdot kt$-connected tournament can be partitioned into $t$ parts, each of which induces a strongly $k$-connected tournament. This is clearly tight up to a constant factor, and it confirms a conjecture of Kühn, Osthus and Townsend (2016).

OU softball ousted by NiJaree Canady, Texas Tech in WCWS semifinals to end NCAA title run https://raiderswire.usatoday.com/story/sports/college/sooners/2025/…

Tournament of Prompts: Evolving LLM Instructions Through Structured Debates and Elo Ratings
Anirudh Nair, Adi Banerjee, Laurent Mombaerts, Matthew Hagen, Tarik Borogovac
https://arxiv.org/abs/2506.00178

Tournament of Prompts: Evolving LLM Instructions Through Structured Debates and Elo Ratings
Prompt engineering represents a critical bottleneck to harness the full potential of Large Language Models (LLMs) for solving complex tasks, as it requires specialized expertise, significant trial-and-error, and manual intervention. This challenge is particularly pronounced for tasks involving subjective quality assessment, where defining explicit optimization objectives becomes fundamentally problematic. Existing automated prompt optimization methods falter in these scenarios, as they typicall…

Idee für ein Spiel: Unreal Tournament meets BattleBit. #GameIdea #GameIdeas #unrealrournament
Die Optik von

Empirical Validation of the Independent Chip Model
Juho Kim
https://arxiv.org/abs/2506.00180 https://arxiv.org/pdf/2506.00180

Empirical Validation of the Independent Chip Model
The independent chip model (ICM) forms a cornerstone of all modern poker tournament strategy. However, despite its prominence, the ICM's performance in the real world has not been sufficiently scrutinized, especially at a large scale. In this paper, we introduce our new dataset of poker tournaments, consisting of results of over ten thousand events. Then, using this dataset, we perform two experiments as part of a large-scale empirical validation of the ICM. First, we verify that the ICM perfor…

Section 7 high school boys basketball tournament 2025 brackets, teams, schedule https://www.sportingnews.com/us/high-school/boys-basketball/news/section-7-high-school-…

This https://arxiv.org/abs/2308.14124 has been replaced.
link: https://scholar.google.com/scholar?q=a

The APX-hardness of the Traveling Tournament Problem
The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in sports scheduling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue, no pair of teams plays each other on two consecutive days, each team plays at most $k$ consecutive home games or away games, and the total traveling distance of all the $n$ teams is minimized. TTP-$k$ allows a polynomial-time approximation scheme when $k=2$ and becomes APX-…

Ark: An Open-source Python-based Framework for Robot Learning
Magnus Dierking, Christopher E. Mower, Sarthak Das, Huang Helong, Jiacheng Qiu, Cody Reading, Wei Chen, Huidong Liang, Huang Guowei, Jan Peters, Quan Xingyue, Jun Wang, Haitham Bou-Ammar
https://arxiv.org/abs/2506.21628

Ark: An Open-source Python-based Framework for Robot Learning
Robotics has made remarkable hardware strides-from DARPA's Urban and Robotics Challenges to the first humanoid-robot kickboxing tournament-yet commercial autonomy still lags behind progress in machine learning. A major bottleneck is software: current robot stacks demand steep learning curves, low-level C/C++ expertise, fragmented tooling, and intricate hardware integration, in stark contrast to the Python-centric, well-documented ecosystems that propelled modern AI. We introduce ARK, an open-so…

This https://arxiv.org/abs/2308.01881 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

The Banks Set and the Bipartisan Set May Be Disjoint
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. We construct a tournament of order 36 for which the Banks set and the bipartisan set are disjoint. This implies that refinements of the Banks set, such as the minimal extending set and the tournament equilibrium set, can also be disjoint from the bipartisan set.

I am ignorant on what it is to be trans or a woman or a world-class athlete, but I THINK the problem here is a doomed project of representing a multidimensional continuously variable attribute with a single Boolean https://infosec.exchange/@JessTheUnstill/114639211101368863

Only a year until the start of the next men's world cup! We've got 365 days (plus the tournament itself) to watch FIFA sink to new lows as it works hard to please its authoritarian (majority) host, all the while lining its pockets and those of its officials. Fans will once again pass the time desperately applying the sausage principle - don't ask how it's made - to the largest sporting event on the planet.

The Devil's Dung? Money as a mechanism of generalized reciprocity in human societies
Eduardo C. Ferraciolli, Francesco Renzini, Tanya V. Araujo, Flaminio Squazzoni
https://arxiv.org/abs/2506.20691

The Devil's Dung? Money as a mechanism of generalized reciprocity in human societies
St. Francis of Assisi (1181/82-1226) famously called money the devil's dung, and indeed money is often associated with greed, inequality, and corruption. Drawing on Nowak's five rules for the evolution of cooperation, we argue here that money promotes the formation of circuits of generalized reciprocity across human groups that are fundamental to social evolution. In an evolutionary tournament, we show that money exchange is an evolutionary stable strategy that promotes cooperation without rely…

"Fifa again under scrutiny for World Cup’s increased carbon footprint"
#Football #Sports #Climate #ClimateChange