Online Algorithms for Market Clearing cs市场清算的在线算法政务司司长.cmu.pptVIP

下载本文档

7
0
约2.11万字
约 225页
2017-03-08 发布于上海
举报
版权申诉

Online Algorithms for Market Clearing cs市场清算的在线算法政务司司长.cmu.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Online Algorithms for Market Clearing cs市场清算的在线算法政务司司长.cmu

Online Algorithms for Market Clearing Martin Zinkevich Joint Work with Avrim Blum and Tuomas Sandholm (SODA 2002) Introduction E-Bay: Single Auction E-Bay: Single Auction E-Bay: Single Auction Improvement #1: Double Auction Graphical Version Improvement #2:Bidding For Different Intervals Temporal Bidding Problem How to Make Money Buy the PS2 from one person for some money, and sell it to someone else for more than you bought it. Keep no inventory, have sellers mail PS2 directly to buyers. Types of Algorithms One can imagine two types of algorithms: Offline: An algorithm which knows the whole sequence before making decisions. Online: An algorithm which finds the type, price, and expiration time of a bid as it is introduced, and must act on a bid before it expires. Formalizing the Goal Find a matching of concurrent buy and sell bids that maximizes profit The Maximal Matching The Offline Problem Convert to a Graph Convert to a Graph Convert to a Weighted Graph Convert to a Weighted Graph Find a Matching of Maximum Weight Find a Matching of Maximum Weight Find a Matching of Maximum Weight Find a Matching of Maximum Weight Find a Matching of Maximum Weight What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… What Online Sees… Two Online Difficulties Getting the Most Matches Getting the Most Per Match Two Small Problems Maximizing Liquidity: maximizing the number of matches The Ice Cream Problem: maximizing profit of one trade Outline Introduction Small Problem #1:Maximizing Liquidity Small Problem #2:The Ice Cream Problem Putting it Together Conclusion New Results Maximizing Liquidity Simplified Matching Let’s try to maximize the number of trades with positive profit on each trade. A Maximal Numeric Matching Also Maximal Numerically Offline: Convert to a Graph Convert to