Online Dispute Resolution and Bargaining
Automated negotiation process seems to be a powerful mechanism to resolve disputes arising from Internet-based transactions. Automated negotiation is an online blind-bidding process in which an automated algorithm evaluates bids from the parties and settles the case if the offers are within a prescribed range.\ Following the arguments of the dispute resolution professionals, the main advantage of this procedure is to promote ''natural'' agreements by restoring the parties' right to negotiate on their own, without the presence of a third party in the shadow of negotiations. Our purpose is to investigate this issue by modelling the automated negotiation process as a two-person bargaining game under incomplete information. A first result states that, given incomplete information, not all mutually beneficial agreements can be attained via the procedure. Furthermore, the settlement rule has a drastic effect on the players' strategies, which induce that the automated negotiation process does not significantly increase the likelihood of a settlement. The ability of the procedure to generate efficiency is only due to the costs imposed on parties if a disagreement occurs, that is the combination of players' risk aversion and uncertainty.
|Date of creation:||Apr 2003|
|Date of revision:|
|Contact details of provider:|| Postal: 93, chemin des Mouilles - B.P.167 69131 - Ecully cedex|
Phone: 33(0)472 29 30 89
Fax: 33(0)47229 30 90
Web page: http://www.gate.cnrs.fr/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Muthoo,Abhinay, 1999. "Bargaining Theory with Applications," Cambridge Books, Cambridge University Press, number 9780521576475, December.
When requesting a correction, please mention this item's handle: RePEc:gat:wpaper:0304. 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: (Nelly Wirth)
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.