IDEAS home Printed from https://ideas.repec.org/p/sce/scecfa/311.html
   My bibliography  Save this paper

Competition among Payment Networks using Generalized Population Based Incremental Learning

Author

Listed:
  • Biliana Alexandrova Kabadjova

    (University of Essex)

  • Andreas Krause

    (University of Bath)

  • Edward Tsang

    (University of Essex)

Abstract

We have developed an agent-based model for competition among payment cards networks. In our model the competitors in the payment card market learn by observing model-based interactions between costumers and merchants at the point of sale (POS). The interactions are represented on lattice with three different connections: local, small world and random. We are studying how the payment card providers improve their strategies in a competitive market. We are using Generalized Population Based Incremental Learning (GPBIL) algorithm as our machine learning technique to evolve strategies for card purveyors. In our Computational Agent-based model of Competition in the Payment Card Market, we are simulating the interactions among consumers and merchants in a way, which to our knowledge has not been explored previously in the literature. The simulation allows us explicitly represent the network externalities in the use/acceptance of payment cards and model its impact on the consumers/merchants decisions to adopt or drop a particular electronic payment. Additionally the decisions of consumers and merchants regarding the subscription and use of electronic cards are guided by the cost of the payment instruments, which is determinate by the payment card providers.

Suggested Citation

  • Biliana Alexandrova Kabadjova & Andreas Krause & Edward Tsang, 2006. "Competition among Payment Networks using Generalized Population Based Incremental Learning," Computing in Economics and Finance 2006 311, Society for Computational Economics.
    • Handle: RePEc:sce:scecfa:311
    as

    Download full text from publisher

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

    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:sce:scecfa:311. 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    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.