Every essay — page 27
Geometry Analysis Algebra Discrete Topology Probability Number Dynamics Logic Computation Applied What's new Series Concepts Search
Applied
A rule for choosing, stated exactly, and what it forces on whoever adopts it.
Agendas that cannot contradict themselves
A court voting on two unconnected questions never contradicts itself, and neither does one voting on a chain of thresholds. A court voting on two premises and their conjunction sometimes does. What separates them is the size of the smallest sets of judgements that cannot all be true: pairs are harmless, because two majorities always share a judge, and triples are not. The same count says exactly how large a supermajority has to be to stay consistent on any agenda.
What a missing input is worth
A model prices a house at 180 from its size, its garden and its bedrooms, and the question is how much of the price each input is responsible for. Make the inputs the players and the average over orders answers it — once somebody decides what the model says when an input is not known. Three reasonable decisions give bedrooms nothing, nothing, and sixteen, for a model that never reads them.
Cutting a link costs both of its ends the same
Three players, any two of whom can earn 1 together — but only if they are linked. Link all three and each is due a third. Remove one link and the player holding both of the others is due two thirds. Averaging over orders on the game the network allows is the one rule under which breaking any link costs the two players it joined exactly the same, and it pays go-betweens more than their links.