Potential functions and the inefficiency of equilibria
نویسنده
چکیده
We survey one area of the emerging field of algorithmic game theory: the use of approximation measures to quantify the inefficiency of game-theoretic equilibria. Potential functions, which enable the application of optimization theory to the study of equilibria, have been a versatile and powerful tool in this area. We use potential functions to bound the inefficiency of equilibria in three diverse, natural classes of games: selfish routing networks, resource allocation games, and Shapley network design games. Mathematics Subject Classification (2000). 68Q25, 68W25, 90B35, 91A65.
منابع مشابه
Oligopoly with Capacity Constraints and Thresholds
Abstract Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...
متن کاملOn the Inefficiency Ratio of Stable Equilibria in Congestion Games
Price of anarchy and price of stability are the primary notions for measuring the efficiency (i.e. the social welfare) of the outcome of a game. Both of these notions focus on extreme cases: one is defined as the inefficiency ratio of the worst-case equilibrium and the other as the best one. Therefore, studying these notions often results in discovering equilibria that are not necessarily the m...
متن کاملPART THREE Qualifying the Inefficiency of Equilibria 439
This chapter presents motivation and definitions for quantifying the inefficiency of equilibria in noncooperative games. We illustrate the basic concepts in four fundamental network models, which are studied in depth in subsequent chapters. We also discuss how measures of the inefficiency of equilibria can guide mechanism and network design.
متن کاملOn the Inefficiency of Equilibria in Congestion Games
We present a short geometric proof for the price of anarchy results that have recently been established in a series of papers on selfish routing in multicommodity flow networks. This novel proof also facilitates two new types of results: On the one hand, we give pseudoapproximation results that depend on the class of allowable cost functions. On the other hand, we derive improved bounds on the ...
متن کاملComputational Study on the Energetic and Electronic Aspects of Tautomeric Equilibria in 5-methylthio-1,2,4-triazole
The main purpose of this research is to investigate computationally the tautomeric reaction pathway of 5-methyl-3-methylthio-1,2,4-triazole from the thermodynamical and mechanistical viewpoints. In this respect, density functional theory (DFT) in conjunction with the quantum theory of atoms in molecule (QTAIM) has been employed to model the energetic and electronic features of tautomeric mechan...
متن کامل