Takuya Tamashiro

Information-Zero Periodic Random-Elimination Chains: Schedule Order, Residue-Class Limits, and Guarded Scaling

Braverman, Etesami, and Mossel (2008, Conjecture 1) predicted an R^(d/r) balance scale when d of every r rounds are daytime actions. For the declared periodic random-elimination executor with weak-majority stopping—not for the unrestricted partial-information game—we settle this...

When Adaptivity Counts: Hit-Count Inspection with Information-Only Queries

We study a hidden-set problem in which perfect point queries acquire information but earn no reward, while a separate exact-q terminal action earns its hit count. Every instance satisfies V_ad^# <= q V_batch^#; taking the supremum over all depths and finite positive-batch instanc...

When Adaptivity Counts: Hit-Count Inspection with Information-Only Queries

This working paper studies finite Bayesian decision problems in which a learner must identify one member of a hidden subset. It distinguishes an unrestricted finite-alphabet message from a physically executable observation protocol that reveals only whether a named point belongs...

The Mathematics of Hidden-Set Decisions: Communication Constraints and Coverage Values

This working paper studies a one-shot finite Bayesian decision problem motivated by Mafia and Werewolf: an encoder observes a hidden subset of an R-element population, emits one of K symbols, and a decoder names one position, succeeding exactly when that position is hidden. For 1...

The Mathematics of Mafia and Werewolf: Fixed-Schedule Random-Elimination Benchmarks

This working paper studies a two-type finite-population elimination process with a fixed periodic schedule, as a random-elimination benchmark for Mafia and Werewolf rather than an unrestricted communication-and-voting game. We formalize the process in Lean 4 and prove an exact or...