Show simple item record

Automated Strategy Searches in an Electronic Goods Market: Learning and Complex Price Schedules

dc.contributor.authorBrooks, Christopher H.
dc.contributor.authorFay, Scott
dc.contributor.authorDas, Rajarshi
dc.contributor.authorMacKie-Mason, Jeffrey K.
dc.contributor.authorKephart, Jeffrey O.
dc.contributor.authorDurfee, Edmund H.
dc.date.accessioned2007-04-11T03:13:53Z
dc.date.available2007-04-11T03:13:53Z
dc.date.issued1999-11
dc.identifier.citationin Proceedings of Electronic Commerce 1999 (EC-99). ACM Press, Denver, CO, November 1999. <http://hdl.handle.net/2027.42/50448>en
dc.identifier.urihttps://hdl.handle.net/2027.42/50448
dc.description.abstractIn an automated market for electronic goods new problems arise that have not been well studied previously. For example, information goods are very flexible. Marginal costs are negligible and nearly limitless bundling and unbundling of these items are possible, in contrast to physical goods. Consequently, producers can offer complex pricing schemes. However, the profit-maximizing design of a complex pricing schedule depends on a producer's knowledge of the distribution of consumer preferences for the available information goods. Preferences are private and can only be gradually uncovered through market experience. In this paper we compare dynamic performance across price schedules of varying complexity. We provide the producer with two machine learning method producer that is performing a naive, knowledge-free form of leanings (function approximation and hill-climbing) which implement a strategy that balances exploitation to maximize current profits against exploration of the profit landscape to improve future profits. We find that the tradeoff between exploitation and exploration is different depending on the learning algorithms employed, and in particular depending on the complexity of the price schedule that if offered. In general, simpler price schedules are more robust and give up less profit during the learning periods even though in our stationary environment learning eventually is complete and the more complex schedules have high long-run profits. These results hold for both learning methods, even though the relative performance of the methods is quite sensitive to choice of initial conditions and differences in the smoothness of the profit landscape for different price schedules. Our results have implications for automated learning and strategic pricing in non-stationary environments, which arise when the consumer population changes, individuals change their preferences, or competing firms change their strategies.en
dc.format.extent1409004 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherACM Pressen
dc.titleAutomated Strategy Searches in an Electronic Goods Market: Learning and Complex Price Schedulesen
dc.typeArticleen_US
dc.subject.hlbsecondlevelInformation and Library Science
dc.subject.hlbtoplevelSocial Sciences
dc.contributor.affiliationumInformation, School ofen
dc.contributor.affiliationumcampusAnn Arboren
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/50448/1/sigecomm.pdfen_US
dc.owningcollnameInformation, School of (SI)


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.