arXiv (OAI Expanded)
open access
Bidding Games with Rewards: Taming Infinite Configuration Space
Bidding games are graph games in which a token is placed on a vertex, each player starts with an initial budget, and a simultaneous auction determines which player moves the token; the players' budgets are then updated accordingly. Motivated by scenarios such as resource-allocation systems in which
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
- Bidding Games with Rewards: Taming Infinite Configuration Space#818902
- Generalized bidding games: Where bidding and stochastic games meet#1146755
- Iterative Combinatorial Auctions#485660
- Very Credible Auction#1083720
- Information acquisition during a descending price auction with asymmetrically informed players#16969
Record · ID 808910
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