arXiv (All)
open access
A PTAS for Non-Adaptive Stochastic Top-$k$ Sum under General Combinatorial Constraints
We study non-adaptive selection of a feasible set $S$ that maximizes the expected sum of the $k$ largest realized values among independent nonnegative discrete random variables. The same objective arises in team hiring and as VCG welfare in an $\ell$-unit auction. The main setting is a fixed-dimensi
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
- On the Power of Determinism in Multi-Item Auctions#1130361
- Prices, Bids, Values: One ML-Powered Combinatorial Auction to Rule Them All#149199
- Online Matching in Convex Bipartite Graphs#972009
- Truthful-in-Expectation MMS Allocations for Chores#1129874
- Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivit#1143260
Record · ID 974626
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