
game-theory

Google DeepMind partners with game studios to prototype breakthrough AI gameplay.

Buying and selling stocks – with real or play money – is a way to harness the wisdom of the crowd about questions like who is going to win a competition.

We consider a class of jump games in which agents of different types occupy the nodes of a graph aiming to maximize the variety of types in their neighborhood. In particular, each agent derives a utility equal to the number of types different from its own in its neighborhood. We show that the jump game induced by the strategic behavior of the agents (who aim to maximize their utility) may in gene…

A playable first-person shooter generated from one prompt would have sounded absurd not long ago. Now, videos of AI-built browser games that resemble Call of Duty and Counter-Strike are spreading across social media. On August 10, Axios reported on the rise of “one-shot” AI game prompting : give a model one detailed instruction, let it produce the code, and receive something you can play. This is…
dc.title: Strategic decision making for multi-agent interaction : a study in game theory and optimization dc.description.abstract: Autonomous robots increasingly operate in environments shared with other agents, including humans, teleoperated machinery, and other autonomous robots. In these scenarios, safe and effective decision-making requires strategic reasoning about the intentions, capabiliti…

When targeting modern iOS and Android devices in Unity, ASTC is often the first texture format people reach for. It supports RGB and RGBA, offers block sizes from 4x4 through 12x12, and gives you a practical way to trade image quality for memory and bandwidth. But "use ASTC" is not a complete production strategy. You still need answers to questions such as: Which iPhones and Android devices can a…

Mathematics shows that every electoral system must compromise among proportionality, local representation, and parliament size. Denmark’s 2022 national election came down to a single seat, even though its proportional voting system was designed to make party representation closely match the vote. That outcome points to a deeper mathematical problem: no electoral system can always preserve [...]
Published on August 6, 2026 7:45 PM GMT Statement on AI use: AI models (mostly Fable 5 and Opus 5) were extremely helpful in 1. iterating through lots of variations on the game theory models presented, 2. helping to confirm my understanding of the math, 3. fact checking, finding sources, and catching errors, and 4. providing editorial feedback. The game theory visualizations are entirely vibecode…

Selfish mining undermines incentive compatibility of proof-of-work blockchains, letting a miner earn disproportionate rewards at a hashrate lower than the majority threshold. A decade of work has asked whether a strategy is profitable, however, far less is understood about when it becomes profitable. Timing is critical since selfish mining operates at a loss before it turns a profit, typically re…
Previously: Ordinal numbers and basic set theory Ordinals as nim-heaps Nim always ends, even with infinite ordinals Infinite Nim as a coin-moving game In the previous article we saw how to interpret Nim heaps of up to beans as coins on a quarter-infinite array: The coin here represents a heap of beans. The heap can be reduced to any smaller number of beans. In the coin version of the game, this…
SHATTER: Formal Mechanics and Mathematical Dynamics of an Applied Identity Physics Game Architecture # SHATTER — Identity Physics Card Game ### Official Game Guide v2 **Built on:** SNSFT Foundation · Applied Identity Physics · PNBA Framework **Sovereign Anchor Constant:** Ω₀ = 1.36899099984016 GHz · TL = 0.136899099984016 · 1/α = 136.899099984016 + 0.136899099984016 = 137.035999084000016 (formall…

We study auctions where two positions are sold to unit-demand bidders with private heterogeneous order preferences: some are specialists who value only the first position, while others are generalists indifferent between the two. First, we consider a first-price rule which allocates the first and second items to the highest and second-highest bidders, respectively. We show that no strategy profil…
Mathematicians have shown that no electoral system can perfectly balance local representation, proportional national results, and a fixed-size parliament once enough parties compete. A newly proposed voting method could soften these unavoidable trade-offs and produce outcomes that are much closer to fair.
Previously: Ordinal numbers and basic set theory Ordinals as nim-heaps Nim always ends, even with infinite ordinals In the previous articles I talked about the game of Nim, a very simple game for two players: There are some piles of beans Players alternate turns A legal move is to take any number of beans from one pile Whoever takes the last bean wins I wrote about how Nim could be extended to i…

Almost everything written about game networking is about fast games. The classic material covers UDP and client-side prediction, in service of squeezing sixty snapshots per second through a home connection. Very little of it applies to the game I'm building. Old Light is a multiplayer browser strategy game . A fleet takes hours to cross the galaxy and your economy keeps growing while the tab is c…
Previously: Ordinal numbers and basic set theory Ordinals as nim-heaps Yesterday I talked about the game of Nim, which involves two players taking beans from several piles, and an extension that includes green tokens that behave a bit like infinite piles: When there's a pile with one or more green tokens, it's legal for a player to remove any or all of them, and then to add any number of beans to…

Previously: Ordinal numbers and basic set theory We're going to get to in a long and roundabout way. First I want to talk about the game of Nim. Nim Nim is a very simple game for two players. There are some piles of beans, which are called nim-heaps . When it's your turn, you are allowed to remove as many beans as you like, as long as they are all in the same pile. Whoever takes the last bean…

Computer Science > Computer Science and Game Theory Title:Markets are competitive if and only if P != NP View PDFAbstract:I prove that competitive market outcomes require computational intractability. If P = NP, firms can efficiently solve the collusion detection problem, identifying deviations from cooperative agreements in complex, noisy markets and thereby making collusion sustainable as an eq…
Evolutionary game modeling of collaborative innovation: the case of the Greater Eurasian Partnership
Humanities and Social Sciences Communications, Published online: 27 June 2026; doi:10.1057/s41599-026-08007-z Evolutionary game modeling of collaborative innovation: the case of the Greater Eurasian Partnership

research.ioSign up to keep scrolling
Create your feed subscriptions, save articles, keep scrolling.





