Budgeted Allocations in the Full-Information Setting

DOI10.1007/978-3-540-85363-3_20zbMath1159.68677OpenAlexW1525162419MaRDI QIDQ3541799

Aravind Srinivasan

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_20

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (4)

On the configuration LP for maximum budgeted allocation ⋮ On best-of-both-worlds fair-share allocations ⋮ Second-price ad auctions with binary bids and markets with good competition ⋮ Valuated matroid-based algorithm for submodular welfare problem

This page was built for publication: Budgeted Allocations in the Full-Information Setting