Token导航 LogoToken导航TokenDH.com
待分类只读github未标认证来源可访问许可证需确认审计通过

grad-auction-theory毕业生拍卖理论

Agent Skill

grad-auction-theory 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要围绕仓库状态、代码变更或协作事项进行整理时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

总安装

367

周安装

15

GitHub Stars

125

下载量

118
CodexClaudeCursorGemini CLI

安装说明

本站只整理中文说明和来源信息,不托管安装包,也不代用户安装。

GitHub

来源数

2

许可证

unknown

最后核验

2026-05-01

来源状态

来源可访问

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:grad-auction-theory(毕业生拍卖理论)
来源仓库:https://github.com/asgard-ai-platform/skills
仓库路径:skills/grad-auction-theory
安装命令:
npx skills add https://github.com/asgard-ai-platform/skills --skill grad-auction-theory
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/asgard-ai-platform/skills --skill grad-auction-theory

简介

grad-auction-theory 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在开发协作中整理项目状态。

  • 适用于围绕代码变更、协作事项或仓库状态进行信息整合的场景。
  • 支持从 GitHub 获取 Issue、PR 和代码变更信息,辅助开发流程管理。
  • 安装方式:npx skills add https://github.com/asgard-ai-platform/skills --skill grad-auction-theory
  • 建议确认权限范围、维护状态,以及是否涉及联网、命令执行或文件读写。

SKILL.md

Auction Theory: Four Canonical Formats and Revenue Equivalence

Overview

Auction theory analyzes strategic bidding behavior across different selling mechanisms. The four canonical formats — English (ascending), Dutch (descending), first-price sealed-bid, and second-price sealed-bid (Vickrey) — generate identical expected revenue under standard assumptions. The Revenue Equivalence Theorem (RET) is the central benchmark; deviations from its assumptions drive all practical auction design decisions.

When to Use

  • Choosing among auction formats for selling goods, spectrum, procurement, or ad slots
  • Analyzing bidder strategy (bid shading, sniping, jump bidding) under a specific format
  • Evaluating whether a proposed auction achieves optimal revenue or efficiency

When NOT to Use

  • Posted-price or negotiated sales where no competitive bidding occurs
  • Multi-unit auctions with complex complementarities (use combinatorial auction frameworks)
  • The seller has no commitment power to enforce auction rules

Assumptions

IRON LAW: Revenue equivalence holds ONLY with risk-neutral bidders,
independent private values (IPV), and symmetric bidders — violate ANY
assumption and auction format matters.
  • Single indivisible object for sale
  • Bidders are risk-neutral expected-utility maximizers
  • Values are independently and identically distributed (IPV)
  • Bidders are symmetric (same distribution of values)
  • Payment is a function of bids only (no externalities)

Methodology

Step 1 — Identify the Value Model Classify the setting: independent private values (IPV), common values, or affiliated values. IPV means each bidder knows their own value with certainty; common values mean the object has one true value unknown to all; affiliated values generalize both.

Step 2 — Derive Equilibrium Bidding Strategies For each auction format, solve for the Bayesian Nash equilibrium. In second-price / English auctions under IPV, bidding true value is dominant. In first-price / Dutch auctions, bidders shade below true value: b(v) = E[Y1 | Y1 < v] where Y1 is the highest competing value.

Step 3 — Apply Revenue Equivalence or Identify Violations Under RET assumptions, all four formats yield the same expected revenue. Check for violations: (a) risk aversion favors first-price over second-price; (b) asymmetric bidders break equivalence; (c) common values introduce the winner's curse and favor English auctions (Milgrom-Weber linkage principle); (d) budget constraints, entry costs, or reserve prices create format-dependent effects.

Step 4 — Recommend Format and Parameters Given the identified deviations, recommend the auction format, optimal reserve price (r* where r* = v0 + [1 - F(r*)] / f(r*) in the IPV case), and any additional design features (e.g., entry fees, information disclosure policy).

Output Format

## Auction Analysis: [Context]

### Value Model
- **Type**: IPV / Common / Affiliated
- **Distribution**: [bidder value distribution]
- **Number of bidders**: [N]
- **Risk attitude**: risk-neutral / risk-averse

### Format Comparison
| Format              | Equilibrium Strategy         | Expected Revenue | Notes        |
|--------------------|------------------------------|-----------------|--------------|
| English (ascending) |                              |                 |              |
| Dutch (descending)  |                              |                 |              |
| First-price sealed  |                              |                 |              |
| Second-price sealed |                              |                 |              |

### Revenue Equivalence Assessment
- **RET holds?** Yes / No
- **Violation source**: [risk aversion / asymmetry / common values / other]
- **Ranking**: [which format generates highest revenue and why]

### Optimal Reserve Price
- **r*** = [value]
- **Derivation**: [brief]

### Recommendation
[Chosen format, reserve price, and rationale]

Gotchas

  • The winner's curse is a common-value phenomenon — it does not apply in pure IPV settings, yet bidders often behave as if it does
  • Revenue equivalence is about *expected* revenue; variance differs across formats (first-price has lower variance)
  • Optimal reserve price excludes some efficient trades — the seller sacrifices efficiency for revenue
  • In practice, English auctions reveal more information, which helps with affiliated values (Milgrom-Weber linkage principle)
  • Collusion is easier in second-price and English auctions; first-price is more robust to bidder rings
  • Online auctions (eBay-style) are not pure English auctions — hard close times, proxy bidding, and sniping change equilibrium behavior

References

  • Vickrey, W. (1961). "Counterspeculation, Auctions, and Competitive Sealed Tenders." *Journal of Finance*.
  • Riley, J. & Samuelson, W. (1981). "Optimal Auctions." *American Economic Review*.
  • Milgrom, P. & Weber, R. (1982). "A Theory of Auctions and Competitive Bidding." *Econometrica*.
  • Krishna, V. (2010). *Auction Theory*, 2nd ed. Academic Press.

适合场景

01

用户想查找某类 Agent Skill 时

02

需要根据任务场景推荐可安装能力包时

03

需要对比不同来源的安装命令和来源信息时

能力概览

能力 1

按任务关键词查找相关 Skills

能力 2

展示可复制的安装命令

能力 3

保留来源站点、仓库和原始说明,方便继续核验

能力 4

展示第三方安全扫描或审计结果

安装后应在对应宿主中按原始 README 的触发条件使用;具体调用方式请以来源页面和 README 为准。

平台分布

Codex

38.27%
按下载量换算45

Claude

29.03%
按下载量换算34

Cursor

17.01%
按下载量换算20

Gemini CLI

9.57%
按下载量换算11

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。当前只有一个来源,正式发布前建议补源仓库或其他目录站核验。

来源信息

继续浏览同类 Skills