In-Game, In-Room, In-World: Reconnecting Video Game Play to the Rest of Kids' Lives

Part of the Volume on the Ecology of Games: Connecting Youth, Games, and Learning The focus of this chapter is on how young people learn to play video games. We have approached this question ethnographically, studying young people playing in their own homes among friends and family. The primary data analyzed for the chapter are videorecordings of play from two perspectives -- in-game and in-room -- which we synchronized into a single side-by-side video record. By looking at in-room actions along with in-game actions, the chapter expands on a separate worlds view that holds video games as a world apart from the rest of kids' lives. Our case material shows instead how game play is quite tangled up with young people's lives, including relations with siblings and parents, patterns of learning at home and school, as well their own imagined futures. Our analysis also documents a remarkable diversity of what we call learning arrangements that young people create among themselves while playing together

Low-Sensitivity Functions from Unambiguous Certificates

We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sided unambiguous certificate complexity ($UC_{min}$). We also show that $UC_{min}$ is lower-bounded by fractional block sensitivity, which means we cannot use these techniques to get a super-quadratic separation between $bs(f)$ and $s(f)$. We also provide a quadratic separation between the tree-sensitivity and decision tree complexity of Boolean functions, disproving a conjecture of Gopalan, Servedio, Tal, and Wigderson (CCC 2016). Along the way, we give a power $1.22$ separation between certificate complexity and one-sided unambiguous certificate complexity, improving the power $1.128$ separation due to G\"o\"os (FOCS 2015). As a consequence, we obtain an improved $\Omega(\log^{1.22} n)$ lower-bound on the co-nondeterministic communication complexity of the Clique vs. Independent Set problem.Comment: 25 pages. This version expands the results and adds Pooya Hatami and Avishay Tal as author