TITLE

Nash equilibrium based fairness

AUTHOR(S)
Kameda, Hisao; Altman, Eitan; Touati, Corinne; Legrand, Arnaud
PUB. DATE
August 2012
SOURCE
Mathematical Methods of Operations Research;Aug2012, Vol. 76 Issue 1, p43
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
There are several approaches of sharing resources among users. There is a noncooperative approach wherein each user strives to maximize its own utility. The most common optimality notion is then the Nash equilibrium. Nash equilibria are generally Pareto inefficient. On the other hand, we consider a Nash equilibrium to be fair as it is defined in a context of fair competition without coalitions (such as cartels and syndicates). We show a general framework of systems wherein there exists a Pareto optimal allocation that is Pareto superior to an inefficient Nash equilibrium. We consider this Pareto optimum to be 'Nash equilibrium based fair.' We further define a 'Nash proportionately fair' Pareto optimum. We then provide conditions for the existence of a Pareto-optimal allocation that is, truly or most closely, proportional to a Nash equilibrium. As examples that fit in the above framework, we consider noncooperative flow-control problems in communication networks, for which we show the conditions on the existence of Nash-proportionately fair Pareto optimal allocations.
ACCESSION #
77495276

 

Related Articles

  • Individually-optimal equilibria of noncooperative games in preference relations. Mashchenko, S. O. // Cybernetics & Systems Analysis;Jan2009, Vol. 45 Issue 1, p153 

    For a game specified on a set of situations by preference relations of players, the individual optimum principle is considered that is a generalization of Nash, Berge, and Pareto optimum principles. On this basis, different types of equilibria and stability of game problems are characterized and...

  • The Set of Pareto-Nash Equilibria in Multicriteria Strategic Games. Lozan, Victoria; Ungureanu, Valeriu // Computer Science Journal of Moldova;2012, Vol. 20 Issue 1, p3 

    The paper investigates the notion of Pareto-Nash equilibrium as continuation of the works [2[4]. Problems and basic theoretical results are exposed. Method of intersection of graphs of best response mappings [3] is applied to solve the dyadic two-criteria games.

  • Task graph pre-scheduling, using Nash equilibrium in game theory. Abdeyazdan, Marjan; Parsa, Saeed; Rahmani, Amir // Journal of Supercomputing;Apr2013, Vol. 64 Issue 1, p177 

    Prescheduling algorithms are targeted at restructuring of task graphs for optimal scheduling. Task graph scheduling is a NP-complete problem. This article offers a prescheduling algorithm for tasks to be executed on the networks of homogeneous processors. The proposed algorithm merges tasks to...

  • Equilibrium in safety strategies and equilibriums in objections and counterobjections in noncooperative games. Iskakov, M. // Automation & Remote Control;Feb2008, Vol. 69 Issue 2, p278 

    The game problem of the sharing of a resource distributed in the section was first stated in the year 1957. The complexity of the model under consideration lies in the fact that for it, in most of the cases, the Nash equilibrium does not exist, but in practice there is an intuitively perceived...

  • Nash Equilibria in Noncooperative Predator-Prey Games. Ramos, Angel Manuel; Roubicek, Tomas // Applied Mathematics & Optimization;Sep2007, Vol. 56 Issue 2, p211 

    A noncooperative game governed by a distributed-parameter predator-prey system is considered, assuming that two players control initial conditions for predator and prey, respectively. Existence of a Nash equilibrium is shown under the condition that the desired population profiles and the...

  • Polymatrix games and optimization problems. Strekalovskii, A.; Enkhbat, R. // Automation & Remote Control;Apr2014, Vol. 75 Issue 4, p632 

    Consideration was given to the properties of the polymatrix game, a finite noncooperative game of N players ( N ⩾ 3). A theorem of reduction of the search for Nash equilibria to an optimization problem was proved. This clears the way to the numerical search of equilibria. Additionally, a...

  • Continuously Essential Set of Nash Equilibria for n-person Noncooperative Games. Sun, Lei; Fan, Xiaodong // Information Technology Journal;2013, Vol. 12 Issue 3, p414 

    This study has established a new perturbed game of the n-person noncooperative game. A new definition of stable set of Nash equilibria is introduced in this way, which called continuously essential set. This study showed that there exists at least one continuously essential component of Nash...

  • Loss of skills in coordination games. Flesch, J.; Schoenmakers, G.; Vrieze, O. // International Journal of Game Theory;Oct2011, Vol. 40 Issue 4, p769 

    This paper deals with 2-player coordination games with vanishing actions, which are repeated games where all diagonal payoffs are strictly positive and all non-diagonal payoffs are zero with the following additional property: At any stage beyond r, if a player has not played a certain action for...

  • The endowment game when n = 2. Hong, Lu // Review of Economic Design;Apr2009, Vol. 13 Issue 1/2, p147 

    This paper considers a well defined problem in the implementation literature: A planner wants to re-allocate goods among two agents but she does not know each agent’s initial endowment of goods. We completely characterize social choice functions that can be implemented by feasible...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics