Metadata-Version: 2.4
Name: coalitionkit-gardener
Version: 0.1.0
Summary: CoalitionKit Gardener: deterministic planning core (strategies, plan sets, tensions, ripples)
Keywords: agents,coordination,a2a,mcp,coalition
Author: Hesham Salama
Author-email: Hesham Salama <hesham@autonomouslab.io>
License-Expression: Apache-2.0
License-File: LICENSE
License-File: NOTICE
Classifier: Development Status :: 4 - Beta
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.12
Classifier: Programming Language :: Python :: 3.13
Classifier: Programming Language :: Python :: 3.14
Classifier: Programming Language :: Python :: 3.15
Classifier: Operating System :: OS Independent
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Requires-Dist: coalitionkit-contracts==0.1.0
Requires-Python: >=3.12
Project-URL: Homepage, https://github.com/HeshamFS/coalitionkit
Project-URL: Repository, https://github.com/HeshamFS/coalitionkit
Project-URL: Issues, https://github.com/HeshamFS/coalitionkit/issues
Project-URL: Changelog, https://github.com/HeshamFS/coalitionkit/blob/main/CHANGELOG.md
Description-Content-Type: text/markdown

# coalitionkit-gardener

The Gardener's planning core: pure, deterministic Python with no model and no network.

- `model`: typed inputs (tasks, offers, vault answers, shares, PSI overlaps, ballots).
- `strategies`: `AuctionStrategy` (Contract-Net with a fairness rule), `MatchStrategy`, `VoteStrategy`.
- `plans`: up to three Pareto-optimal plans on (total cost, max share ratio, a third objective).
- `tension`: tensions for unmet hard constraints, vote ties and large trade-offs.
- `ripple`: the tasks a change invalidates, and a re-plan that leaves every other assignment alone.

The auction minimises total private cost plus lambda times the maximum ratio of assigned hours
to agreed share. A vault "no" removes a bid; the constraint itself stays in its owner's vault.
