{"title":"Other Auctions","authors":"","doi":"10.1017/9781108691079.009","DOIUrl":"https://doi.org/10.1017/9781108691079.009","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130616629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Double-Sided Auction","authors":"","doi":"10.1017/9781108691079.008","DOIUrl":"https://doi.org/10.1017/9781108691079.008","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125992182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"First-Price Sealed-Bid Auction","authors":"","doi":"10.1017/9781108691079.005","DOIUrl":"https://doi.org/10.1017/9781108691079.005","url":null,"abstract":"! Subgames in extensive form games ! Games of incomplete information ! Cournot competition under incomplete information ! Battle of the sexes under incomplete information ! Today (February 6, 2003) ! Battle of the sexes under incomplete information ! First-price sealed-bid auctions ! Equilibrium recap ! One-card poker game Example: Battle of the sexes ! t A is privately known to Alice and t B is privately known to Bob ! t A and t B are independent draws from a uniform distribution on [0,x] 1, 2+ t B 0, 0 Football 0, 0 2+t A , 1 Ballet Football Ballet Alice Bob Example: Battle of the sexes ! Strategies ! Alice: Play ballet if t A exceeds a critical value c A ; otherwise, play football ! Bob: Play football if t B exceeds a critical value c B ; otherwise, play ballet 1, 2+ t B 0, 0 Football 0, 0 2+t A , 1 Ballet Football Ballet Alice Bob Example: Battle of the sexes ! Alice's expected payoffs ! Alice plays Ballet: (c B /x)(2+t A) ! Alice plays Football: 1-c B /x ! Play ballet if (c B /x)(2+t A)> 1-c B /x → t A >x/c B-3 = c A ! Bob's expected payoffs ! Bob plays Ballet: 1-c A /x ! Bob plays Football: (c A /x)(2+ t B) ! Play football if (c A /x)(2+t B)> 1-c A /x → t B >x/c A-3 = c B Example: Battle of the sexes ! t A > x/c B-3 = c A ! t B > x/c A-3 = c B ! c A = c B = c ! c 2 +3c-x=0 c = (-3+√(9+4x))/2 ! What is the probability that Alice plays ballet? 1-c A /x = 1 – [-3+√(9+4x)]/2x ! What is the probability that Bob plays football? 1-c B /x = 1 – [-3+√(9+4x)]/2x In the limit (x→0), these probabilities approach 2/3! ! Two bidders, one good ! Bidder i's valuation for the good is v i , is known only by bidder i. Valuations are independently and uniformly distributed on [0,1]. ! Each bidder i submits a nonnegative bid b i. The higher bidder wins and pays his bid. Other bidder pays and receives nothing.","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126174456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal Auction Using Machine Learning","authors":"","doi":"10.1017/9781108691079.010","DOIUrl":"https://doi.org/10.1017/9781108691079.010","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128092992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mechanism Design and Auction Theory in Computer Networks","authors":"","doi":"10.1017/9781108691079.003","DOIUrl":"https://doi.org/10.1017/9781108691079.003","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Open-Cry Auction","authors":"","doi":"10.1017/9781108691079.004","DOIUrl":"https://doi.org/10.1017/9781108691079.004","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130464312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Index","authors":"","doi":"10.1017/9781108691079.011","DOIUrl":"https://doi.org/10.1017/9781108691079.011","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"59 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126090378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Overview of Modern Computer Networks","authors":"D. Niyato, Nguyen Cong Luong, Ping Wang, Zhu Han","doi":"10.1017/9781108691079.002","DOIUrl":"https://doi.org/10.1017/9781108691079.002","url":null,"abstract":"","PeriodicalId":192855,"journal":{"name":"Auction Theory for Computer Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114817611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：