arXiv (All)
open access
Multi-Capacity Online Assortment Optimization with Consecutive Stays under Markov Chain Choice
We study online assortment optimization under Markov chain choice and independent Bernoulli arrivals, with each period's request type known in advance. Each product may have multiple interchangeable physical copies, and each booking reserves consecutive service slots on a single copy. Customers choo
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
- Assortment Optimization under Logit-Based Multi-Purchase Choice Models#1063875
- A Column Generation Algorithm for Choice-Based Network Revenue Management#942810
- On the benefits of assortment-based cooperation among independent producers#954854
- Assortment-based cooperation between two make-to-stock firms#954855
- The probabilistic serial mechanism with private endowments#955130
Record · ID 1403457
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