arXiv (OAI Expanded)
open access
The Fixed Server Locality Gap of Count Load Assignment Games
Marginal-contribution pricing makes the social objective an exact potential, but does not ensure that every stable assignment is efficient. We study indivisible clients with heterogeneous workloads, arbitrary nonnegative assignment costs, and private eligibility menus over a fixed number of shared s
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
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Stable Allocations, Unstable Payment Paths: The Shapley Value and Voluntary Coalition Formation#1034240
- Ascending Auctions for Combinatorial Markets with Frictions: A Unified Framework via Discrete Convex Analysis#820417
- Online Matching in Convex Bipartite Graphs#972009
- First Come, First Served?#743082
Record · ID 1084434
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