Skip to content
Back to skills

Shoham Leyton Brown 2009 Mas Foundations

ASecurity

Frame multi-agent problems by representation, incentives, computation, communication, and verification assumptions. NOT for selecting a mechanism without checking the actual information and incentive model.

  • 2 stars
  • 0 votes
  • 0 copies
  • 0 views
  • Added September 24, 2026
businessgoaws

Security analysis

A100/100

Pro scans all 14 files and shows the line behind each finding

Scanned October 2, 2026

npx -y skills add curiositech/port-daddy --skill shoham-leyton-brown-2009-mas-foundations --agent claude-code

Installs into .claude/skills of the current project.

Are you the author of Shoham Leyton Brown 2009 Mas Foundations?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for Shoham Leyton Brown 2009 Mas Foundations
[![Security: A — Skills Directory](https://www.skillsdirectory.com/api/skills/curiositech-shoham-leyton-brown-2009-mas-foundations-port-daddy/badge)](https://www.skillsdirectory.com/skills/curiositech-shoham-leyton-brown-2009-mas-foundations-port-daddy)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
---
name: shoham-leyton-brown-2009-mas-foundations
description: Frame multi-agent problems by representation, incentives, computation, communication, and verification assumptions. NOT for selecting a mechanism without checking the actual information and incentive model.
metadata:
  category: Research & Academic
  tags: [multi-agent-systems, game-theory, mechanism-design, dcop, complexity]
---

# Multi-agent foundations: model before choosing a method

Use this skill to turn an informal coordination claim into an inspectable model. It draws on Shoham and Leyton-Brown's foundations text; textbook results apply only with their stated representation and theorem hypotheses.

```mermaid
flowchart LR
  T[Types and information] --> S[Actions, strategies, reports]
  S --> O[Outcome/allocation rule]
  O --> U[Utilities and payments]
  U --> Q[Solution question]
  Q --> C[Computation and certificate]
  X[Observation and execution evidence] -. separate system condition .-> O
```

```mermaid
flowchart TB
  P[Coordination problem] --> F[Write variables, domains, hard constraints]
  P --> I[Write agents, alternatives, utilities, information]
  F --> FS{Need feasibility protocol?}
  I --> IS{Need incentive analysis?}
  FS -->|yes| CSP[Choose CSP/DCSP method and delivery assumptions]
  IS -->|yes| G[Specify game or mechanism and deviations]
  CSP --> R[Evaluate outcomes and failure modes]
  G --> R
  R --> E[Bind authorization and execution evidence separately]
```

## A five-part modeling pass

1. **Representation.** State players or variable owners, domains/actions, constraints, information sets, utilities and timing. A task graph is not automatically an extensive-form game; a capability catalog is not automatically a CSP.
2. **Question.** Name whether the task is feasibility, candidate verification, finding one equilibrium, enumerating equilibria, or searching for a property. These can have different complexity.
3. **Conditions.** Check finite domains, perfect recall, zero-sum relation, quasilinear utility, priors, a credible signal/mediator, and message-delivery assumptions as applicable.
4. **Method and certificate.** Keep a deviation table, LP dual/primal condition, nogood trace, potential descent trace, or an explicit statement that the output is heuristic.
5. **Operational boundary.** Authentication, authorization, real-world outcome observation, payment collection, and external effect completion are not granted by a game/CSP theorem.

## Constructed sanity check

Two workers report costs 2 and 5 for one job. “Allocate to the lower report and pay the second report” is only a fixture until types, quasilinear utilities, allocation feasibility, payment collection, and verification of job completion are specified. It illustrates what a truthfulness analysis needs; it is not a procurement guarantee.

## References

- [Representation and tractability](references/representation-and-tractability.md): normal/extensive/sequence forms, CE, congestion and stochastic-game boundaries.
- [Computational equilibrium complexity](references/computational-equilibrium-complexity.md): verify versus find versus property-search, zero-sum LP and general-sum limits.
- [Distributed constraint solving](references/distributed-constraint-solving.md): filtering, nogoods and ABT under finite CSP/message conditions.
- [Bounded rationality and cooperation](references/bounded-rationality-cooperation.md): automata, fictitious play, Minimax-Q and potential-game scope.
- [Mechanism impossibilities](references/mechanism-design-impossibilities.md): Arrow, Gibbard–Satterthwaite, Myerson–Satterthwaite, AGV, Roberts and VCG conditions.
- [Mechanism design in constrained reality](references/mechanism-design-constrained-reality.md): contracts, bribes, mediators, verified scheduling, bandwidth, multicast, matching and observability.
- [Source model and theorem conditions](references/source-model-and-theorem-conditions.md): primary-source map and reusable theorem worksheet.
- [Diagram index](diagrams/INDEX.md): three complementary model worksheets.

Files in this skill

  • CHANGELOG.md231 B
  • SKILL.md12.5 KB
  • _book_identity.json5 KB
  • _raw_response.md99.3 KB
  • diagrams/01_flowchart_multiagent_system_design_decis.md2.2 KB
  • diagrams/02_stateDiagram-v2_information_structure_&_equili.md2.2 KB
  • diagrams/03_quadrantChart_mechanism_design_tradeoff_spac.md728 B
  • diagrams/INDEX.md1 KB
  • references/bounded-rationality-cooperation.md14.1 KB
  • references/computational-equilibrium-complexity.md16 KB
  • references/distributed-constraint-solving.md10.1 KB
  • references/mechanism-design-constrained-reality.md21.6 KB
  • references/mechanism-design-impossibilities.md15.5 KB
  • references/representation-and-tractability.md16.6 KB

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…