{"status":"OK","data":{"id":64831,"identifier":"DVN/FQ3CCH","persistentUrl":"https://doi.org/10.7910/DVN/FQ3CCH","protocol":"doi","authority":"10.7910","separator":"/","publisher":"Harvard Dataverse","publicationDate":"2007-11-28","storageIdentifier":"s3://1902.1/10643","effectiveDatasetFileCountLimit":1000,"datasetFileUploadsAvailable":991,"datasetType":"dataset","locks":[],"latestVersion":{"id":66705,"datasetId":64831,"datasetPersistentId":"doi:10.7910/DVN/FQ3CCH","datasetType":"dataset","storageIdentifier":"s3://1902.1/10643","versionNumber":1,"internalVersionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","latestVersionPublishingState":"RELEASED","deaccessionNote":"Initial version","deaccessionLink":"","lastUpdateTime":"2007-11-28T05:00:00Z","releaseTime":"2007-11-28T00:00:00Z","createTime":"2007-10-01T14:51:15Z","alternativePersistentId":"hdl:1902.1/10643","publicationDate":"2007-11-28","citationDate":"2007-11-28","effectiveDatasetFileCountLimit":1000,"datasetFileUploadsAvailable":991,"license":{"name":"CC0 1.0","uri":"http://creativecommons.org/publicdomain/zero/1.0","iconUri":"https://licensebuttons.net/p/zero/1.0/88x31.png","rightsIdentifier":"CC0-1.0","rightsIdentifierScheme":"SPDX","schemeUri":"https://spdx.org/licenses/","languageCode":"en"},"fileAccessRequest":false,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","name":"citation","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Replication data for: The BARISTA: A Model for Bid Arrivals in Online Auctions"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Galit Shmueli"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"Department of Decision and Information Technologies and The Center for Electronic Markets and Enterprises, Robert H. Smith School of Business, University of Maryland, College Park"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Ralph P. Russo"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"Department of Statistics & Actuarial Science, University of Iowa, Iowa City"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"and Wolfgang Jank"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"Department of Decision and Information Technologies The Center for Electronic Markets and Enterprises, Robert H. Smith School of Business, University of Maryland, College Park"}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"N/A"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"The arrival process of bidders and bids in online auctions is important for studying and modeling supply and demand in the online marketplace. A popular assumption in the online auction literature is that a Poisson bidder arrival process is a reasonable approximation. This approximation underlies theoretical derivations, statistical models, and simulations used in field studies. However, when it comes to the bid arrivals, empirical research has shown that the process is far from Poisson, with early bidding and last-moment bids taking place. An additional feature that has been reported by various authors is an apparent self-similarity in the bid arrival process. Despite the wide evidence for the changing bidding intensities and the self-similarity, there has been no rigorous attempt at developing a model that adequately approximates bid arrivals and accounts for these features. The goal of this paper is to introduce a family of distributions that\nwell-approximate the bid time distribution in hard-close auctions. We call this the BARISTA process (Bid ARrivals In STAges) because of its ability to generate different intensities at different stages. We describe the properties of this model, show how to simulate bid arrivals from it, and how to use it for estimation and inference. We illustrate its power and usefulness by fitting simulated and real data from eBay.com. Finally, we show how a Poisson bidder arrival process relates to a BARIST\nA bid arrival process."}}]},{"typeName":"keyword","multiple":true,"typeClass":"compound","value":[{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Non-homogenous Poisson process"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"bidding frequency"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"self-similarity"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"bidding dynamics"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"sniping"}}]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationCitation":{"typeName":"publicationCitation","multiple":false,"typeClass":"primitive","value":"Galit Shmueli, Ralph P. Russo, and Wolfgang Jank. Forthcoming. \"The BARISTA: A Model for Bid Arrivals in Online Auctions.\" Ann. Appl. Statist."}}]},{"typeName":"notesText","multiple":false,"typeClass":"primitive","value":"Subject: STANDARD DEPOSIT TERMS 1.0  Type: DATAPASS:TERMS:STANDARD:1.0  Notes: This study was deposited under the of the Data-PASS standard deposit terms. A copy of the usage agreement is included in the file section of this study.;"},{"typeName":"distributor","multiple":true,"typeClass":"compound","value":[{"distributorName":{"typeName":"distributorName","multiple":false,"typeClass":"primitive","value":"Institute for Mathematical Statistics"},"distributorURL":{"typeName":"distributorURL","multiple":false,"typeClass":"primitive","value":"http://www.imstat.org/aoas/"},"distributorLogoURL":{"typeName":"distributorLogoURL","multiple":false,"typeClass":"primitive","value":"http://www.imstat.org/images/imslogo1.gif"}}]},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2007-10-01"}]}},"files":[{"description":"Original article for this study","label":"AOAS0612-001R1A0.pdf","restricted":false,"version":1,"datasetVersionId":66705,"categories":["1. Documentation"],"dataFile":{"id":655229,"persistentId":"doi:10.7910/DVN/FQ3CCH/C3AUVF","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/C3AUVF","filename":"AOAS0612-001R1A0.pdf","contentType":"application/pdf","friendlyType":"Adobe PDF","filesize":395410,"description":"Original article for this study","categories":["1. Documentation"],"storageIdentifier":"s3://dvn-cloud:5778","rootDataFileId":-1,"md5":"731a8da19506acdfbf3dfd1e245b4525","checksum":{"type":"MD5","value":"731a8da19506acdfbf3dfd1e245b4525"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Computes the CDF(threshold) = P(X <= threshold) for a given dataset","label":"Empirical_CDF.m","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655231,"persistentId":"doi:10.7910/DVN/FQ3CCH/GAMNHE","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/GAMNHE","filename":"Empirical_CDF.m","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":340,"description":"Computes the CDF(threshold) = P(X <= threshold) for a given dataset","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5780","rootDataFileId":-1,"md5":"7cfff3cc5705d585a92dade43ce22af7","checksum":{"type":"MD5","value":"7cfff3cc5705d585a92dade43ce22af7"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Computes CDF-based (quick&crude) estimate of alpha3 in [T-d2,T] based on s,t within this interval, and gives a standard error based on bootstrap","label":"QC_alpha3.m","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655230,"persistentId":"doi:10.7910/DVN/FQ3CCH/L4SWJV","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/L4SWJV","filename":"QC_alpha3.m","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1016,"description":"Computes CDF-based (quick&crude) estimate of alpha3 in [T-d2,T] based on s,t within this interval, and gives a standard error based on bootstrap","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5781","rootDataFileId":-1,"md5":"99cb3afbf0bf77f8ab2587ffdec86ad8","checksum":{"type":"MD5","value":"99cb3afbf0bf77f8ab2587ffdec86ad8"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Estimates alpha1 and alpha2","label":"QC_alpha.asv","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655234,"persistentId":"doi:10.7910/DVN/FQ3CCH/1ICMHX","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/1ICMHX","filename":"QC_alpha.asv","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1057,"description":"Estimates alpha1 and alpha2","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5782","rootDataFileId":-1,"md5":"fb4de4570961118712ae9d75df261d84","checksum":{"type":"MD5","value":"fb4de4570961118712ae9d75df261d84"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Computes quick&dirty estimate of alpha in a chosen interval ([0,d1], [d1-T-d2], or [T-d2,T]) based on two values T-s and T-t within this interval. The program gives an estimate and a standard error based on bootstrap","label":"QC_alpha.m","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655233,"persistentId":"doi:10.7910/DVN/FQ3CCH/BKAUVY","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/BKAUVY","filename":"QC_alpha.m","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1199,"description":"Computes quick&dirty estimate of alpha in a chosen interval ([0,d1], [d1-T-d2], or [T-d2,T]) based on two values T-s and T-t within this interval. The program gives an estimate and a standard error based on bootstrap","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5783","rootDataFileId":-1,"md5":"478c6bb7f067fc2e5e8ab99519886c6e","checksum":{"type":"MD5","value":"478c6bb7f067fc2e5e8ab99519886c6e"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Computes CDF-based (quick&crude) estimates of the change-points d1, d2 and their standard error based on bootstrap","label":"QC_d1d2.m","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655235,"persistentId":"doi:10.7910/DVN/FQ3CCH/BZOVYC","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/BZOVYC","filename":"QC_d1d2.m","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1941,"description":"Computes CDF-based (quick&crude) estimates of the change-points d1, d2 and their standard error based on bootstrap","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5784","rootDataFileId":-1,"md5":"59fd2667bd605d16359448f90fcdeda2","checksum":{"type":"MD5","value":"59fd2667bd605d16359448f90fcdeda2"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Detailed information on the files in this study","label":"Readme.txt","restricted":false,"version":1,"datasetVersionId":66705,"categories":["1. Documentation"],"dataFile":{"id":655236,"persistentId":"doi:10.7910/DVN/FQ3CCH/JSBKL5","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/JSBKL5","filename":"Readme.txt","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1292,"description":"Detailed information on the files in this study","categories":["1. Documentation"],"storageIdentifier":"s3://dvn-cloud:5785","rootDataFileId":-1,"md5":"d1725de29e264238c99bc2b91d1d6218","checksum":{"type":"MD5","value":"d1725de29e264238c99bc2b91d1d6218"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Simulates arrivals from this process","label":"SimulateBarristaArrivals.m","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655232,"persistentId":"doi:10.7910/DVN/FQ3CCH/MFXETW","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/MFXETW","filename":"SimulateBarristaArrivals.m","contentType":"text/plain; charset=US-ASCII","friendlyType":"Plain Text","filesize":1347,"description":"Simulates arrivals from this process","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5786","rootDataFileId":-1,"md5":"4edd0ade6b252de985c4904481712424","checksum":{"type":"MD5","value":"4edd0ade6b252de985c4904481712424"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}},{"description":"Zip file containing all of the files required to replicate this study","label":"supplement.zip","restricted":false,"version":1,"datasetVersionId":66705,"categories":["2. Data"],"dataFile":{"id":655228,"persistentId":"doi:10.7910/DVN/FQ3CCH/W44QPP","pidURL":"https://doi.org/10.7910/DVN/FQ3CCH/W44QPP","filename":"supplement.zip","contentType":"application/zip","friendlyType":"ZIP Archive","filesize":4535,"description":"Zip file containing all of the files required to replicate this study","categories":["2. Data"],"storageIdentifier":"s3://dvn-cloud:5779","rootDataFileId":-1,"md5":"5e1bcfd2f80ae4f67882c0a709ddb182","checksum":{"type":"MD5","value":"5e1bcfd2f80ae4f67882c0a709ddb182"},"tabularData":false,"creationDate":"2007-10-01","publicationDate":"2007-11-27","lastUpdateTime":"2007-11-28T05:00:00Z","fileAccessRequest":false}}]}}}