Advanced Search
MyIDEAS: Login to save this paper or follow this series

On Price Recognition and Computational Complexity in a Monopolistic Model

Contents:

Author Info

  • Rubenstein, A.

Abstract

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.)

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.

Bibliographic Info

Paper provided by Tel Aviv in its series Papers with number 35-91.

as in new window
Length: 20 pages
Date of creation: 1991
Date of revision:
Handle: RePEc:fth:teavfo:35-91

Contact details of provider:
Postal: Israel TEL-AVIV UNIVERSITY, THE FOERDER INSTITUTE FOR ECONOMIC RESEARCH, RAMAT AVIV 69 978 TEL AVIV ISRAEL.
Phone: 972-3-640-9255
Fax: 972-3-640-5815
Email:
Web page: http://econ.tau.ac.il/research/foerder.asp
More information through EDIRC

Related research

Keywords: competition ; economic models ; prices;

Other versions of this item:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.