scientific article; zbMATH DE number 7528582

DOI10.4086/toc.2022.v018a006OpenAlexW4225912864MaRDI QIDQ5077148

Alon Eden, Michal Feldman, Uriel Feige

Publication date: 18 May 2022

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.05501

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

marketsonline matchingpricing mechanism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Theory of computing (68Qxx)

Related Items (2)

A Dual Approach for Dynamic Pricing in Multidemand Markets ⋮ Max-min greedy matching problem: hardness for the adversary and fractional variant

Cites Work

• Unnamed Item
• Unnamed Item
• Computing Walrasian equilibria: fast algorithms and structural properties
• Approximation hardness of edge dominating set problems
• Bayesian Mechanism Design
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• Combinatorial Auctions via Posted Prices
• Short Tours through Large Linear Forests
• Online bipartite matching with unknown distributions
• Online bipartite matching with random arrivals
• College Admissions and the Stability of Marriage
• On conceptually simple algorithms for variants of online bipartite matching

This page was built for publication: