Algorithms & Society.

Make proposals, keep tentative matches, and eliminate blocking pairs.

Route traffic and compare individual incentives with total delay.

Deploy a forecast and watch the forecast change what happens next.

Move two thresholds and compare different meanings of an equal outcome.

Release a noisy count and see why repeated queries spend a privacy budget.

Open ranked search results and balance useful finds against unnecessary reading.

Edit a four-node link graph and follow the flow of ranking mass.

Grow a network by favouring well-connected nodes or choosing uniformly.

Flip transmitted bits and discover what one-error correction can and cannot repair.

Escape a local minimum by allowing some uphill moves, then cool the search.

Trace tentative distances through a weighted network until the cheapest route is certified.

Draw walls and compare grid searches using different heuristic weights.

Replay the same page requests through three-slot and four-slot caches under FIFO and LRU.

Search hidden binary objectives, then change the family from unrestricted to ordered.

Compare equal-size row and column districts, then edit the voter geography.

Follow a symbol rulebook before considering what successful output establishes about understanding.

Find a hidden integer by splitting an ordered range rather than scanning every candidate.

Sort six values with two algorithms and count comparisons separately from writes.

Build a prefix code, change symbol weights and encode your own short message.

Add a server to a hash ring and inspect exactly which keys move.

Insert words into a tiny bit filter and hunt for a false positive.

Execute cycles of favourite available houses without using money.

Queue five known-duration jobs and compare complete schedules’ average waiting.