bid-auction

Coordinate decentralized job allocation among autonomous agents using reputation-weighted Thompson sampling.

3|2|Updated May 12, 2026
One-click install
npx skills add https://github.com/kriscendobot/garden --skill bid-auction
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: bid-auction
Source: https://github.com/kriscendobot/garden/tree/main/skills/bid-auction
Command: npx skills add https://github.com/kriscendobot/garden --skill bid-auction

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) components.

What problem does it solve?

This skill solves the problem of inefficient and centralized job distribution in a fleet of autonomous agents by enabling a deterministic, reputation-based auction system that selects the most cost-effective worker for any given task.

Core Features & Use Cases

  • Deterministic Auctioning: Uses Thompson sampling to resolve job awards without a central auctioneer, ensuring reproducibility across all hosts.
  • Reputation-Based Selection: Automatically tracks worker performance and cost metrics to favor efficient, high-quality implementations over simple token-cost metrics.
  • Use Case: When a new coding task is posted to the garden, this skill allows multiple worker agents to bid on the job based on their historical success rate and estimated cost, ensuring the most capable agent handles the work.

Quick Start

Enable the bid-auction skill by setting the environment variable GARDEN_QUOTA_ROUTING to auction in your worker configuration.

Frequently Asked Questions about bid-auction

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I distribute jobs across autonomous agents without a central authority?

Decentralized job allocation among autonomous agents is coordinated using reputation-weighted Thompson sampling. This approach evaluates cost-per-acceptance metrics and historical performance data to distribute tasks efficiently across distributed worker fleets without a central authority.

What is reputation-weighted Thompson sampling for task scheduling?

Reputation-weighted Thompson sampling is a mechanism that resolves job awards by tracking worker performance and cost metrics. It favors efficient, high-quality implementations over simple token-cost metrics to select the most capable agent for a task.

How do I enable decentralized auction-based routing for worker agents?

Enable auction-based routing by setting the environment variable GARDEN_QUOTA_ROUTING to auction in your worker configuration. This activates the deterministic, CAS-safe award logic for job assignment across your worker fleet.

Does deterministic auctioning ensure reproducible job assignments across distributed hosts?

Deterministic auctioning uses Thompson sampling to resolve job awards without a central auctioneer, ensuring reproducibility across all hosts. It implements CAS-safe award logic to guarantee consistent job assignment throughout the distributed system.

When should I use a reputation-based auction system instead of centralized job distribution?

Use a reputation-based auction system when inefficient centralized job distribution bottlenecks your autonomous agent fleet. It is ideal when new coding tasks are posted and multiple worker agents need to bid based on historical success rates and estimated costs.