IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v75y1997i0p209-23210.1023-a1018959529628.html
   My bibliography  Save this article

A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions

Author

Listed:
  • Ho Geun Lee
  • Ronald Lee

Abstract

This paper presents a hybrid approach for sealed bid auction that integrates linear programming and logic modeling techniques. A linear programming model for the sealed bid auction considers only prices for transaction arrangements and yields multiple market cores when goods from sellers are equally attractive to many buyers. The hybrid approach takes into account ordinal preferences of traders as well to find the best market core. On the one hand, the hybrid approach uses a linear programming model to maximize total surplus of market participants based on the bid and ask prices. On the other hand, it employs a logical inferencing approach to satisfy traders' ordinal preferences that are not included in a single combination of bid and ask prices. A constraint logic programming scheme, which combines a mathematical program with a logical inferencing technique in an integrated formalism, is introduced to implement the hybrid approach. The hybrid approach is validated through market simulations, where a set of computer-generated trading data is applied to both the hybrid approach and the linear programming model for their market performance comparison. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Ho Geun Lee & Ronald Lee, 1997. "A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions," Annals of Operations Research, Springer, vol. 75(0), pages 209-232, January.
    • Handle: RePEc:spr:annopr:v:75:y:1997:i:0:p:209-232:10.1023/a:1018959529628
    DOI: 10.1023/A:1018959529628
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018959529628
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018959529628?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:75:y:1997:i:0:p:209-232:10.1023/a:1018959529628. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.