最大最小贪婪匹配

Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation Pub Date : 2018-03-14 DOI:10.1145/3338506.3340238

Alon Eden, U. Feige, M. Feldman

{"title":"最大最小贪婪匹配","authors":"Alon Eden, U. Feige, M. Feldman","doi":"10.1145/3338506.3340238","DOIUrl":null,"url":null,"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.","PeriodicalId":102358,"journal":{"name":"Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Max-min greedy matching\",\"authors\":\"Alon Eden, U. Feige, M. Feldman\",\"doi\":\"10.1145/3338506.3340238\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":102358,\"journal\":{\"name\":\"Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3338506.3340238\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3338506.3340238","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

由于Karp, Vazirani和Vazirani[2]的在线二部匹配问题及其变化，由于其适用于某些经济环境中的分配问题，最近对Karp, Vazirani和Vazirani的在线二部匹配问题及其变化产生了很大的兴趣。一个突出的例子是在线广告;详情请参见Metha[3]的调查。这些新问题既有理论上的优美，又有实际意义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Max-min greedy matching

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation

自引率

0.00%

发文量