Harvard DASH
metadata only
Learning Strategies for Bidding in Online Advertisement Auctions With Noisy Feedback
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
- Continuous auction models#1064189
- A Pattern Recognition Algorithm to Estimate the Bidding Strategy in the Ancillary Service Market#284483
- Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges#427471
- Aspiration-based Perturbed Learning Automata in Weakly-Acyclic Games with Noisy Utility Measurements#793519
- Aspiration-based Perturbed Learning Automata in Weakly-Acyclic Games with Noisy Utility Measurements#789515
Record · ID 643852
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