Post-hoc auditing framework opens black box of neural auction mechanisms
CITransNet is unpacked using sparse autoencoders to verify features that align with Myerson's optimal auction theory.
Stories per day · 30 days
1 RSS
Relatedagentic-markets1auctions1auditing1blockchain1compositionality1eip-15591embedllm1ethereum1neural-auctions1planar-mechanisms1price-of-anarchy1prompt-routing1representation-learning1sample-efficiency1transaction-fees1
9 stories, newest first · one card per story
Stories tagged #mechanism-design
Assur modules improve limited-data learning of planar mechanisms
Assur-derived features give a geometric-mean 1.8× sample-efficiency gain over flattened adjacency and position inputs.
Paper proposes EIP-1559 extension admitting some transactions below the base fee
Selected early-execution consumers fund providers that opt out of the early region, with surplus burned and eight properties proved.
Price of Anarchy of First-Price Auctions in Agentic Markets
Paper shows competitive floors and near-independent values improve welfare in first-price agentic prompt auctions.
Cogentic: Multi-Agent Orchestration for Automated Proof Discovery
Cogentic, a multi-agent proof harness using Gemini, produced expert-verified novel results on five open math and CS problems.
When Privacy Moves ML-Mediated Decisions On Device: Information and Incentive Misalignment in Auctions
On-device auction simulation shows stale budgets cause large overspend and incentive-breaking payment deviations.
Credible AUctions via MPC Gadgets: Bounding Information Leakage Under Abort
Cryptographers propose Sequential Revelation Auctions that limit abort leakage with a small MPC gadget and finite penalties.
Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts
The paper proves minimax-optimal regret of order T^(m/(m+1)) for repeated online contract design with unrestricted bounded contracts and arbitrary agent action spaces.
Guiding Worker Self-Selection in Crowdsourcing Contests: An LLM-Augmented Algorithmic Approach
Researchers introduce GRAF, a greedy framework for crowdsourcing contest self-selection, and LLMScore, an LLM-driven method that auto-designs its scoring algorithm.