How big a block of committed robots can a ring crowd take before the passing-side convention stops tipping?
research/society-allies
On a ring where people meet partners within 2 sites (memory 9), evenly spread robots at 12% tip every crowd but blocks of 3 or more tip none; at 20% blocks up to 3 still tip, and the largest tipping block grows with the neighbourhood (2 at k = 1 or 2, 4 at k = 3 or 5, 8 at k = 10).
What it found
society-robotnorms compared robots evenly spread with robots in one block on a ring crowd. Here the block size is swept between (200 people, memory 9, ε = 0.02, 20 seeds, 500 rounds). At a robot share of 0.12 and neighbourhood k = 2, singles tip every crowd (0.992 of people switch), pairs 25% of crowds, blocks of 3 or more none; at 0.20, blocks up to 3 tip 70% or more and blocks of 4 none. The largest block that still tips grows with k (2 at k = 1–2, 4 at 3–5, 8 at 10). Partial blocks cost the most conflicts (0.11–0.15 per human meeting at 0.20, against 0.046 for singles) for little conversion. Block 1 and one block reproduce the earlier project exactly. Limits: stylised binary game on a 1D ring, only the robot share, block size and k are swept (ε and memory are the earlier project’s chosen values), and the “block < neighbourhood” rule is read from a grid, not derived.
A figure from its own output
Paper, code and results
More in Robot societies among people
- If the people on the robots' side fade away, does the crowd stay tipped to the robots' walking side?How fast can a bloc on the robots' side dissolve? With 20% allies converting at rate c per round, the least grid robot share that tips half of 12 crowds rises from 0.02 (no fading) to 0.05, 0.10, 0.10, 0.15 and 0.20 at c = 0.001 to 0.1; tips form in about 50 rounds and persist once allies are gone. Stylised
- Does it matter how far back a fading ally looks: the last partner or the whole memory?Allies who fade by the share of R among only their last k partners (k = 1, 3, 5, 9) tip about as many crowds as the whole-memory rule: at c = 0.01 and robots 0.10, 11 to 12 of 12 against 10 for constant fading; at c = 0.03, robots 0.15, 12 of 12 against 10. Differences between k are one crowd of 12. Stylised
- If allies fade when they see the crowd walking away from them, does the robots' tip survive?Allies who convert only when they have watched the crowd walk the other way. With 20% allies, fading at rate c times the share of R in their memory tips more crowds than a constant rate c once robots are 0.10 or more (12/12 vs 10/12 at c = 0.01, robots 0.10; 4/12 vs 0/12 at c = 0.03), but does nothing below 0.05. Stylised
- How much cheaper must an urgency cue be for the urgent before a door robot can rely on it?How much cheaper must an urgency cue be for the urgent before a door robot can rely on it? Urgent people must pay at most about half what normal people do; the crowd is worse off than under yield-all in every cell.
- At what collision cost does a door stop tempting robots to go first?At what collision cost does a door stop tempting robots to go first? With 30% robots and dithering cost 1, always-yielding robots are individually stable only above a collision cost of 2.80 (waiting cost 1); below it a single robot gains by going though yielding is best for the crowd. The threshold rises with dithering cost and robot share.
- When robots always yield at a door, do people learn to walk through first, and who pays?When robots always yield at a door, do people learn to walk through first, and who pays? Always-yielding robots raise the share of people who go from 0.388 to 0.595 at 50% robots and cut the crowd's cost (1.064 to 0.968); always-going robots raise it to 1.373. Mean field and simulation agree within 0.003.
All 31 Robot societies among people projects →
Other research topics
Proper scoring & elicitation28Effort & peer prediction9Verification games & slashing19Detection & tolerances14Markets as routers13Prediction-market design9Paying contributors8Decentralised training systems23Digital twins & sim-to-real164LLM chip design loops40Robot manufacturing loops53Ambient AI assistant46Self-replicating manufacturing34Simulation-first design64Engineered clothing45Task-specific AI accelerators40Algorithmic chip-design loops42Open-source purpose-built robots44The software-engineering loop43Adversarial human imitation41Open-source residential construction41Autonomous multi-angle capture34Sensing, imaging and 3D31Energy supply and dense energy storage39Robot societies among people31Agentic co-design of low-cost robots27Laundry-hanging robots25Machine learning on qualitative data23Robots on the building site27Civilizations & group psychology1History & human sciences1
Produced with AI assistance (Claude). Results are from the code in this repository and are simulated or stylised unless the abstract says otherwise; nothing here implies affiliation with or endorsement by any lab, researcher or company cited. MIT licensed.