On Price Recognition and Computational Complexity in a Monopolistic Model
A single seller of an indivisible good operates in a market with many consumers who differ in their ability to process information. The consumers' constraints are modeled in two submodels: the first in terms of the limits on the number of sets in the partition of the price space, and the second in terms of the limits on the complexity of the operation he can use to process a price offer. For the construction of the second submodel, the tool of a 'perceptron' is borrowed from the parallel computation literature. The author demonstrates that the heterogeneity of consumers' abilities can be used by the seller to profitably discriminate among them. Copyright 1993 by University of Chicago Press.
(This abstract was borrowed from another version of this item.)
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1991|
|Date of revision:|
|Contact details of provider:|| Postal: Israel TEL-AVIV UNIVERSITY, THE FOERDER INSTITUTE FOR ECONOMIC RESEARCH, RAMAT AVIV 69 978 TEL AVIV ISRAEL.|
Web page: http://econ.tau.ac.il/foerder/about
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:teavfo:35-91. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.