Show simple item record

Protocols for automated negotiations with buyer anonymity and seller reputations

dc.contributor.authorCranor, Lorrie Faithen_US
dc.contributor.authorResnick, Paul J.en_US
dc.date.accessioned2006-09-11T16:03:22Z
dc.date.available2006-09-11T16:03:22Z
dc.date.issued2000-03en_US
dc.identifier.citationCranor, Lorrie Faith; Resnick, Paul; (2000). "Protocols for automated negotiations with buyer anonymity and seller reputations." Netnomics 2(1): 1-23. <http://hdl.handle.net/2027.42/45434>en_US
dc.identifier.issn1385-9587en_US
dc.identifier.issn1573-7071en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/45434
dc.description.abstractIn many Internet commerce applications buyers can easily achieve anonymity, limiting what a seller can learn about any buyer individually. However, because sellers need to keep a fixed web address, buyers can probe them repeatedly or pool their information about sellers with the information obtained by other buyers; hence, sellers' strategies become public knowledge. Under assumptions of buyer anonymity, publicly‐known seller strategies, and no negotiation transaction costs for buyers, we find that take‐it‐or‐leave‐it offers will yield at least as much seller profit as any attempt at price discrimination could yield. As we relax those assumptions, however, we find that sellers, and in some cases buyers as well, may benefit from a more general bargaining protocol.en_US
dc.format.extent152022 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherEconomic Growthen_US
dc.subject.otherEconomics / Management Scienceen_US
dc.subject.otherData Structures, Cryptology and Information Theoryen_US
dc.subject.otherEconomic Theoryen_US
dc.subject.otherBusiness Information Systemsen_US
dc.titleProtocols for automated negotiations with buyer anonymity and seller reputationsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbsecondlevelBusiness (General)en_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumSchool of Information, The University of Michigan, Ann Arbor, MI, 48109‐1092, USAen_US
dc.contributor.affiliationotherAT&T Labs‐Research, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/45434/1/11066_2004_Article_329139.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1023/A:1019170325938en_US
dc.identifier.sourceNetnomicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.