A Note On AgentBased Imperfect Competition
The model we discuss in this note is a reexamination of the classical Bertrand model of imperfect competition. The main difference is that consumers are allowed to have some strategic behavior when deciding from which one of the two sellers they will buy.Two sellers offering the same homogeneous product compete against each other in a market with a certain number m of potential buyers. At each period t\quad (t=1,2,\ldots ,T) the market opens (and closes) a fixed number of times R that we will refer to as rounds([footnote] Note the difference between periods and rounds. Each period (for instance, a week) contains R rounds (for instance, 7 days).) . The two sellers decide at the beginning of each period a strategy that specifies the course of action to take at each of its rounds contingent on what happened in previous rounds of the same period. Thus, at the beginning of each round, each of the two sellers sets a price ([footnote] The model could also be thought as a model of competition in some other attribute of the product such as quality or location) for his product according to their strategies for that period. Then, the market opens and the two prices become known to everybody. The m buyers walk in and each of them decides from which of the two sellers will buy based on the observation of this two prices. Trade takes place and a new round begins. After R rounds (end of the period) both sellers update their strategies according to some procedure that will be specified.The idea behind this sequence of events is that each seller uses the R rounds to learn about the behavior of its competitor. Thus, each period represents a step in a learning procedure. The model can also be thought as a evolutionary model where each period represents the end of an old generation of sellers and buyers and the birth of a new generation that inherits the characteristics of its parent generation with, hopefully, some improvements. We will refer to the two intuitions indistinctly.We will approach the resolution of the situation sketched above using two related but different tools. The two of them consider a probabilistic learning (or evolutionary) mechanism and in the two of them we will discuss how the consumers' behavior can affect the competition between the sellers.First, we consider the case in which the learning procedure can be described by a deterministic dynamic system that uses expected values. Using strong simplifying assumptions we are able to solve this case and to produce a complete description of how the learning process behaves. We also discuss the problems involved when we try to relax some of the assumptions made.The second approach is an instance of AgentBased Computational Economics techniques. We use finite automata (encoded as binary strings) to represent the strategies played by the sellers (and also by the buyers) and a decentralized adaptive process based on the models of genetic algorithms to simulate the stochastic process of learning or evolution. With this technique we can relax some of the strong assumptions used in the first approach and still obtain the same basic results. Additionally, as an agent representation issue, we modify the standard operators used in genetic algorithm techniques to make them more suitable to social (or economic) simulations. First, we use a modified mutation operator in which mutations do not take place on a locuswise basis of the binarily encoded automata but on a statewise basis of the underlying automata. The reason for this is that locuswise mutations induce a non uniform distribution over the set of automata that can be the result of the mutation of a given automata. As a consequence of this, when an automaton mutates, some automata are more likely to be the resulting ``mutant'' than others, which could produce an unwanted erratic behavior of the genetic algorithm dynamics. Second, we modify the standard single point crossover operator to furnish it with a social interaction meaning. In this sense, we introduce the partial imitation crossover operator according to which two parent strings (i.e. two parent automata) can only exchange information that makes sense to exchange. This is important due to the special characteristics of the binary representation of finite automata. Indeed, it can be easily showed that the single point crossover operator could produce, from two identical ``parents'', two automata whose behavior is exactly the opposite from the behavior of their ``parents''. This is not only awkward but could also induced an strange behavior in the underlying dynamics.Finally, we like to think that the limitations of the first approach (analytical) provide a good motivation for the second approach (AgentBased simulations). Indeed, although both approaches address the same problem, we show that the use of AgentBased computational techniques allows us to relax hypothesis and overcome the limitations of the analytical approach.
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.
Length:  
Date of creation:  05 Jul 2000 
Handle:  RePEc:sce:scecf0:278 
Contact details of provider:  Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain Fax: +34 93 542 17 46 Web page: http://enginy.upf.es/SCE/ Email: More information through EDIRC

No references listed on IDEAS
You can help add them by filling out this form.
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf0:278. 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: (Christopher F. Baum)
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.