Conference paper
Max-Min Greedy Matching
NetEcon '19:Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation
SIGMETRICS '19: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (United States, Phoenix, 28/Jun/2019 - 28/Jun/2019)
Jun/2019
Abstract
There has been much recent interest in the online bipartite matching problem of Karp, Vazirani and Vazirani [2], and variations of it, due to its applicability to allocation problems in certain economic settings. A prominent example is online advertising; for more details, see the survey by Metha [3]. The new problems are both theoretically elegant and practically relevant.
Details
- Title
- Max-Min Greedy Matching
- Creators
- Alon Eden (Corresponding Author) - Tel Aviv UniversityUriel Feige (null) - 972WIS_INST___83Michal Feldman (null) - Microsoft Research (Israel, Jerusalem)
- Resource Type
- Conference paper
- Publication Details
- NetEcon '19:Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation; Jun/2019
- Number of pages
- 1
- Series
- Acm Sigcomm Computer Communication Review
- Publisher
- Association for Computing Machinery (ACM)
- Language
- English
- DOI
- https://doi.org/10.1145/3338506.3340238
- Conference
- SIGMETRICS '19: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (United States, Phoenix, 28/Jun/2019 - 28/Jun/2019)
- Grant note
- A substantial part of this work was conducted in Microsoft Research, Herzeliya, Israel. The work of U. Feige was supported in part by the Israel Science Foundation (grant No. 1388/16). The work of M. Feldman and A. Eden was partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement number 337122, the Israel Science Foundation (grant number 317/17), and the Blavatnik family foundation.
- Record Identifier
- 993264436603596
Metrics
7 Record Views