Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add product-on-purpose/thinking-framework-skills --skill think-minimax-regretgit clone --depth 1 https://github.com/product-on-purpose/thinking-framework-skillsWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/product-on-purpose/thinking-framework-skills/think-minimax-regret)<a href="https://agentmods.dev/skills/product-on-purpose/thinking-framework-skills/think-minimax-regret"><img src="https://agentmods.dev/badge/skills/product-on-purpose/thinking-framework-skills/think-minimax-regret/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/product-on-purpose/thinking-framework-skills/think-minimax-regret"><img src="https://agentmods.dev/badge/skills/product-on-purpose/thinking-framework-skills/think-minimax-regret.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00077 | $0.02517 |
| Opus 5 | $0.00039 | $0.01259 |
| Sonnet 5 | $0.00015 | $0.00503 |
| Haiku 4.5 | $0.00008 | $0.00252 |
Grade A, and why
think-minimax-regret scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 12d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 73 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Minimax Regret
Some choices pit a few options you control against a few states of the world you do not - the market runs hot, flat, or cold; the rival enters or stays out; the regulation passes or fails - and there is no defensible way to attach probabilities to those states. Expected value cannot run there, because it needs a distribution that does not exist. Minimax regret is the criterion built for exactly that regime. The durable cognitive move is to stop scoring raw payoff and start scoring opportunity loss: for each state, ask how much worse off this option leaves you than the option that turns out best in that state, then choose the option whose single worst regret across all states is smallest. It is Savage's less-pessimistic relative of Wald's maximin - it hedges against being badly wrong without throwing away all upside to protect a worst case that barely moves. The output is a regret matrix with the per-option maximum regret, the minimax pick marked, and the state that binds that pick - built with no probabilities over the states.
When to Use
- A few discrete options face a few discrete, uncontrollable states of nature, and no trustworthy probability distribution over those states exists (so an expected-value calculation cannot legitimately run).
- The stakes justify making the trade-offs explicit, and you want a rule that hedges against the "if only I had chosen the other one" outcome rather than one that bets on a guessed distribution.
- One-shot decisions where historical frequencies do not apply: a new-product launch into speculative market scenarios, a one-time investment, a policy choice under deep uncertainty.
- You want a choice rule that is less brutally pessimistic than pure maximin because it scores opportunity loss, not raw worst payoff.
When NOT to Use
- Do not use it when a defensible probability distribution exists. If you can source even rough base rates for the states, discarding them to run a probability-free criterion throws away real information. Price the uncertainty with
think-expected-value-decision-treeinstead (chance nodes whose probabilities sum to one, rolled back to an expected value). Minimax regret is for the regime where expected value legitimately cannot be computed, not a substitute for doing the probability work when it is available. This is the closest sibling and the most important wall. - Do not use it to score options on attributes you can assert. Ranking options on weighted criteria you control (cost, fit, speed, risk) with no states of nature and no opportunity-loss transform is
think-decision-option-review. That answers "which option scores best on my criteria"; minimax regret answers "which option minimizes worst-case regret across uncontrollable futures." If there are no states of nature, this is the wrong tool. - Do not use it when the option set is unstable or gameable. This is the criterion's deepest formal flaw, not a quibble. Because regret in each state is defined relative to the best option in the current set, adding or removing an option - even a dominated one that would never be chosen - can recompute the column maxima and flip the recommendation (a violation of the independence of irrelevant alternatives, Chernoff 1954). If someone can pad the option list, or the set is fluid, the answer can be steered without changing anything real. Freeze a defensible option set first, or do not use the criterion.
- Do not invent the states or the payoffs and then trust them. Like any matrix method, it renders fabricated inputs in an authoritative grammar; a regret table built on made-up cell values produces a confident answer about nothing.
- Do not present its pick as the one rational answer. It is one criterion among several (maximin, maximax, Hurwicz, Laplace) that can each recommend a different option on the same matrix. Report it as a hedge against worst-case opportunity loss and note where the criteria disagree, never as the uniquely correct choice.
- Do not use it when the states cannot even be enumerated. True deep uncertainty where you cannot list the relevant futures breaks the matrix at step one. That is a framing problem, not a scoring one.
What ships with it
5 files beside SKILL.md in the same directory: the scripts, references and assets a skill reads on demand. Not counted in the per-session cost; read them before you install if any of them is executable.
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 12d ago First seen · 73 lines · 77 tokens per session scan A a034c9abdae4
think-minimax-regret is a skill published in the GitHub repository product-on-purpose/thinking-framework-skills (15 stars, last pushed today), licensed Apache-2.0. It adds 77 tokens to every session and 2,517 once invoked, about $0.0004 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
Other skills, from other repositories
ops-demo
CocoOps demo mode activator — populates .cocoplus/ops/demo/ with realistic mock data and sets cocoplus.toml [demo] enabled = true. Invoked via $ops demo.
add-analytics
Add Google Analytics 4 tracking to any project. Detects framework, adds tracking code, sets up events, and configures privacy settings.
agent-teams-simplify-and-harden
Implementation + audit loop using parallel agent teams with structured simplify, harden, and document passes. Spawns implementation agents to do the work, then audit agents to find complexity, security gaps, and spec deviations, then loops until code compiles cleanly, all tests pass, and auditors find zero issues or…
acl-rule-analysis
Vendor-agnostic ACL and firewall rule analysis with shadowed rule detection, overly permissive rule identification, unused rule discovery, redundant rule flagging, and rule ordering optimization. Covers ACLs (Cisco/JunOS/EOS) and firewall policies (PAN-OS/FortiGate/CheckPoint).
agent-team-orchestration
Orchestrate multi-agent teams with defined roles, task lifecycles, handoff protocols, and review workflows. Use when: (1) Setting up a team of 2+ agents with different specializations, (2) Defining task routing and lifecycle (inbox → spec → build → review → done), (3) Creating handoff protocols between agents, (4)…
agent-bom-enforce
Enforce security policies on MCP tool calls and block dangerous operations at runtime. Use when: "block risky calls", "apply policy", "proxy", "runtime protection", "policy enforcement", "intercept MCP calls".