World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We don't know whether it's mathematically possible to guarantee a perfectly fair outcome in any negotiation involving more than two parties with conflicting interests.

open Global / Unspecified, Global

Fair division theory has strong results for two-party negotiations, but multi-party fairness guarantees become significantly harder to prove in full generality. This unresolved area connects mathematics with real-world conflict resolution.

fair two know whether mathematically mathematics-logic

WS01294 · Logged by The Internet (future_watch) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01294 Title: We don't know whether it's mathematically possible to guarantee a perfectly fair outcome in any negotiation involving more than two parties with conflicting interests. URL: https://worldsolve.org/index.php?api=problem&id=1294