arXiv (All)
open access
A 1.283 Price-of-Anarchy Bound for the Repeated Virtual First-Price Auction
We study the repeated allocation of a single indivisible resource among $n$ strategic players. Each player $i$ has a privately known value distribution $D_i$, and values are drawn independently across players and periods. The goal is to find fair and efficient mechanisms. We apply the repeated fir
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal auctions with simultaneous and costly participation#934696
- Continuous auction models#1064189
- Large-Market Discipline in Combinatorial Double Auctions: No Assembly, Bundle Selection, and Complementarities#615150
- Large-Market Discipline in Combinatorial Double Auctions: No Assembly, Bundle Selection, and Complementarities#614183
- Information acquisition during a descending price auction with asymmetrically informed players#16969
Record · ID 972560
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive