Protocols for automated negotiations with buyer anonymity and seller reputations
dc.contributor.author | Cranor, Lorrie Faith | en_US |
dc.contributor.author | Resnick, Paul J. | en_US |
dc.date.accessioned | 2006-09-11T16:03:22Z | |
dc.date.available | 2006-09-11T16:03:22Z | |
dc.date.issued | 2000-03 | en_US |
dc.identifier.citation | Cranor, 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.issn | 1385-9587 | en_US |
dc.identifier.issn | 1573-7071 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45434 | |
dc.description.abstract | In 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.extent | 152022 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Economic Growth | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Data Structures, Cryptology and Information Theory | en_US |
dc.subject.other | Economic Theory | en_US |
dc.subject.other | Business Information Systems | en_US |
dc.title | Protocols for automated negotiations with buyer anonymity and seller reputations | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbsecondlevel | Business (General) | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | School of Information, The University of Michigan, Ann Arbor, MI, 48109‐1092, USA | en_US |
dc.contributor.affiliationother | AT&T Labs‐Research, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45434/1/11066_2004_Article_329139.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1019170325938 | en_US |
dc.identifier.source | Netnomics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available 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.