Show HN: Mediator.ai – Using Nash bargaining and LLMs to systematize fairness
TL;DR Highlight
Combining Nash equilibrium theory with LLMs, Mediator.ai automatically generates mutually acceptable settlement proposals for disputes, applicable to real-world scenarios like founder equity splits and contract disagreements.
Who Should Read
Developers and startup founders navigating negotiations—such as co-founder equity disputes, contract disagreements, or shared living expense allocation—as well as AI engineers interested in game theory-based decision-making systems powered by LLMs.
Core Mechanics
- Mediator.ai operates based on the cooperative bargaining theory (Nash Bargaining Solution) proposed by economist John Nash in 1950. While this mathematical framework isn't new, the key is LLMs converting party statements written in natural language into a format processable by mathematics.
- Each party independently inputs their position without knowing what the other has written. Mediator analyzes both statements, extracting key figures (monthly rent, actual working hours, amounts waived, revenue growth, etc.).
- The system generates multiple candidate settlements, then iteratively evaluates and improves them using a Genetic Algorithm. Each candidate is scored against both parties’ requirements, and the process repeats 'until no further improvement is possible'.
- In a bakery example, when Maya (60 hours/week operator) and Daniel (25 hours/week production) were at odds over 70/30 vs. 50/50 equity, the system proposed 62/38 initial equity + Daniel’s earn-back path (1% for every 200 hours, up to +5%). This structure itemizes contributions instead of a simple compromise.
- The settlement details all contributions as individual items, such as Maya owing Daniel $4,800 in rent (with an additional 2% equity for repayment within 24 months), Daniel waiving $12,000 in distributions ($6,000 from investment, quarterly payments from profits), and Maya receiving a $1,800/month operating management fee (paid before profit distribution).
- The intended use case is described as 'situations where both parties want an agreement but negotiations are stalled'—such as founder equity disputes, shared housing cost allocation, or contractor disputes. It assumes collaborative negotiation, unlike arbitration or litigation, which are binding.
- Technically, the LLM converts natural language input into structured preferences (Utility Function), while Nash Bargaining Solution mathematics calculates the optimal settlement point.
Evidence
- "A commenter with a background as a professional mediator pointed out that the tool is closer to arbitration than mediation. True mediation helps parties reach their own conclusions, rather than a mediator presenting a fair outcome, and emotional/human factors (a $50,000 dispute ending with an apology) are key—aspects this tool doesn’t address."
How to Apply
- When co-founders have an equity dispute, separately inputting each person’s contributions (time, funds, opportunity cost) into Mediator.ai can explore third-party settlement structures (earn-back clauses, installment payments) that neither side considered.
- In disputes with contractors over unpaid/overcharged amounts, inputting both sides’ positions into a Nash-based draft agreement before resorting to legal action can serve as a negotiation starting point. However, the results should be used as an exploratory framework, not a binding decision.
- If you want to implement an LLM + game theory architecture yourself, this case—LLM converting natural language input into preference numbers → Nash Bargaining equations calculating the optimal point → Genetic Algorithm iteratively improving—can serve as a reference pipeline. Shapley Value is also a viable alternative framework.
- Applying it first to emotionally sensitive but quantifiable situations (household chores, expense allocation) can help you understand the tool’s limitations and strengths. Expecting a complete agreement is unrealistic; using it to discover structures you hadn’t thought of is more practical.
Terminology
Related Papers
Show HN: adamsreview – better multi-agent PR reviews for Claude Code
Claude Code에서 최대 7개의 병렬 서브 에이전트가 각각 다른 관점으로 PR을 리뷰하고, 자동 수정까지 해주는 오픈소스 플러그인이다. 기존 /review나 CodeRabbit보다 실제 버그를 더 많이 잡는다고 주장하지만 커뮤니티에서는 복잡도와 실효성에 대한 회의론도 나왔다.
How Fast Does Claude, Acting as a User Space IP Stack, Respond to Pings?
Claude Code에게 IP 패킷을 직접 파싱하고 ICMP echo reply를 구성하도록 시켜서 실제로 ping에 응답하게 만든 실험으로, 'Markdown이 곧 코드이고 LLM이 프로세서'라는 아이디어를 네트워크 스택 수준까지 밀어붙인 재미있는 사례다.
Show HN: Git for AI Agents
AI 코딩 에이전트(Claude Code 등)가 수행한 모든 툴 호출을 자동으로 추적하고, 어떤 프롬프트가 어느 코드 줄을 작성했는지 blame까지 가능한 버전 관리 도구다.
Principles for agent-native CLIs
AI 에이전트가 CLI 도구를 더 잘 사용할 수 있도록 설계하는 원칙들을 정리한 글로, 에이전트가 CLI를 도구로 활용하는 빈도가 높아지면서 이 설계 방식이 실용적으로 중요해지고 있다.
Agent-harness-kit scaffolding for multi-agent workflows (MCP, provider-agnostic)
여러 AI 에이전트가 서로 역할을 나눠 협업할 수 있도록 조율하는 scaffolding 도구로, Vite처럼 설정 없이 빠르게 멀티 에이전트 파이프라인을 구성할 수 있다.
Show HN: Tilde.run – Agent sandbox with a transactional, versioned filesystem
AI 에이전트가 실제 프로덕션 데이터를 건드려도 롤백할 수 있는 격리된 샌드박스 환경을 제공하는 도구로, GitHub/S3/Google Drive를 하나의 버전 관리 파일시스템으로 묶어준다.