AFTD Auto-Formalizing Theoretical Domains

procurement_agent_utility

def

The utility of an agent with cost c who submits the bids mine (one per identity) while all other identities bid others: the sum over its identities of payment minus c times allocated work.

Statement

noncomputable def procurement_agent_utility (alloc pay : List ℝ → ℕ → ℝ) (c : ℝ)
    (mine others : List ℝ) : ℝ
Defined in
arXiv:2603.27779 v1, Sec. 2 (Def. 1 utilities, Def. 3 PNE, Def. 4 Sybil-proof, Def. 5 ex-post safe), complete-information procurement of one divisible unit of work; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Used by 6
  • is_ex_post_safe_procurement_forA procurement mechanism is ex-post safe for an agent of cost c if some bidding strategy guarantees nonnegative utility against all other…
  • proportional_share_no_pne_of_safe_all_costsIf a proportional-share mechanism is ex-post safe for every nonnegative cost, then no profile with at least one agent and nonnegative…
  • stake_share_pne_non_winner_take_allIn the stake-share mechanism with K, M > 0 and all costs at most L, every pure Nash equilibrium (with at least one agent) gives positive…
  • is_sybil_proof_procurementA procurement mechanism is Sybil-proof if, for every cost and every multi-bid strategy, some single bid does at least as well against…
  • proportional_share_utility_eqIn a proportional-share mechanism an agent's utility is s / (s + R) times (pool(s + R) - c).
  • is_procurement_pneA profile of (multi-)bids is a pure Nash equilibrium of the procurement game if all bids are nonnegative and no agent can gain by…

Lean source view module on GitHub

/-- Utility of an agent with cost `c` whose identities bid `mine` while all other identities bid `others` (the agent's identities are listed first). -/
noncomputable def procurement_agent_utility (alloc pay : List ℝ → ℕ → ℝ) (c : ℝ)
    (mine others : List ℝ) : ℝ :=
  ∑ j ∈ Finset.range mine.length, (pay (mine ++ others) j - c * alloc (mine ++ others) j)
See it in the graphDiscuss this resultChallenge it