How to allocate goods in an online market?

DOI10.1007/s00453-014-9964-7zbMath1414.91249OpenAlexW2053778803MaRDI QIDQ262246

F. Blanchet-Sadri, M. Dambrine

Publication date: 29 March 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9964-7

zbMATH Keywords

fairnessmarket equilibriumonline algorithmallocationsocial welfare

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy primal-dual algorithm for dynamic resource allocation in complex networks
• Online Primal-Dual Algorithms for Covering and Packing
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• Market equilibrium via a primal--dual algorithm for a convex program
• Online algorithms for market clearing
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Algorithmic Game Theory
• Existence of an Equilibrium for a Competitive Economy