IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v10y1963i1p11-21.html
   My bibliography  Save this article

Toward a study of bidding processes some constant‐sum games

Author

Listed:
  • James H. Griesmer
  • Martin Shubik
  • Thomas J. Watson

Abstract

The study of bidding has presented both economics and psychology with a host of as yet unresolved problems. The lack of understanding of these problems has been manifested in the difficulties confronting policy‐makers in the framing of laws to deal with collusive or restrictive practices in bidding under various market mechanisms. On the one hand, a theory of competitive behavior may call for all competitors to charge the same price for the same product, yet the submission of identical bids may, in fact, be a criterion of collusion. This paper, the first of a series on bidding, gives a general and preliminary discussion of several of the factors entering into the construction of models of the bidding process. Following this discussion, a number of bidding situations, formulated as two‐person constant‐sum games are examined. A number of open questions, suggested during the investigation of such games. are mentioned. Succeeding papers will be devoted to the more important cases of bidding models formulated as non‐constant‐sum games, both for single‐shot bids and for sequences of bids.

Suggested Citation

  • James H. Griesmer & Martin Shubik & Thomas J. Watson, 1963. "Toward a study of bidding processes some constant‐sum games," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 10(1), pages 11-21, March.
  • Handle: RePEc:wly:navlog:v:10:y:1963:i:1:p:11-21
    DOI: 10.1002/nav.3800100103
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800100103
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.3800100103?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:10:y:1963:i:1:p:11-21. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.