寻找矩阵秩估值的公平和有效分配

IF 1.1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS ACM Transactions on Economics and Computation Pub Date : 2020-03-16 DOI:10.1007/978-3-030-57980-7_3
Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick
{"title":"寻找矩阵秩估值的公平和有效分配","authors":"Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick","doi":"10.1007/978-3-030-57980-7_3","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":42216,"journal":{"name":"ACM Transactions on Economics and Computation","volume":null,"pages":null},"PeriodicalIF":1.1000,"publicationDate":"2020-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Finding Fair and Efficient Allocations for Matroid Rank Valuations\",\"authors\":\"Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick\",\"doi\":\"10.1007/978-3-030-57980-7_3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":42216,\"journal\":{\"name\":\"ACM Transactions on Economics and Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2020-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-57980-7_3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-57980-7_3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 45
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Finding Fair and Efficient Allocations for Matroid Rank Valuations
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Economics and Computation
ACM Transactions on Economics and Computation COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
3.80
自引率
0.00%
发文量
11
期刊介绍: The ACM Transactions on Economics and Computation welcomes submissions of the highest quality that concern the intersection of computer science and economics. Of interest to the journal is any topic relevant to both economists and computer scientists, including but not limited to the following: Agents in networks Algorithmic game theory Computation of equilibria Computational social choice Cost of strategic behavior and cost of decentralization ("price of anarchy") Design and analysis of electronic markets Economics of computational advertising Electronic commerce Learning in games and markets Mechanism design Paid search auctions Privacy Recommendation / reputation / trust systems Systems resilient against malicious agents.
期刊最新文献
Convexity in Real-time Bidding and Related Problems Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals Blockchain-Based Decentralized Reward Sharing: The case of mining pools Editorial from the New Co-Editors-in-Chief of ACM Transactions on Economics and Computation Price of Anarchy in Algorithmic Matching of Romantic Partners
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1