IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2408.02492.html
   My bibliography  Save this paper

Bargaining via Weber's law

Author

Listed:
  • V. G. Bardakhchyan
  • A. E. Allahverdyan

Abstract

We solve the two-player bargaining problem using Weber's law in psychophysics, which is applied to the perception of utility changes. By applying this law, one of the players (or both of them) defines lower and upper utility thresholds, such that once the lower threshold is established, bargaining continues in the inter-threshold domain where the solutions are acceptable to both parties. This provides a sequential solution to the bargaining problem, and it can be implemented iteratively reaching well-defined outcomes. The solution is Pareto-optimal, symmetric, and is invariant to affine-transformations of utilities. For susceptible players, iterations are unnecessary, so they converge in one stage toward the (axiomatic) Nash solution of the bargaining problem. This situation also accounts for the asymmetric Nash solution, where the weights of each player are expressed via their Weber constants. Thus the Nash solution is reached without external arbiters and without requiring the independence of irrelevant alternatives. For non-susceptible players our approach leads to different results.

Suggested Citation

  • V. G. Bardakhchyan & A. E. Allahverdyan, 2024. "Bargaining via Weber's law," Papers 2408.02492, arXiv.org, revised Sep 2024.
  • Handle: RePEc:arx:papers:2408.02492
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2408.02492
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2408.02492. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.