Nash Equilibrium in Social Media

نویسنده

  • Farzad Salehisadaghiani
چکیده

We assume that the players’ cost functions are not necessarily dependent on the actions of all players. This is due to better mimicking the standard social media rules. A communication graph is defined for the game through which players are able to share their information with only their neighbors. We assume that the communication neighbors necessarily affect the players’ cost functions while the reverse is not always true.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incorporating Game Theory and Nash Equilibrium Concepts to Predict Social Network Community Behaviors

In June 2016, there were an estimated 1.55 billion active users on the most popular social media platform, Facebook[1]. As of April 26th, 2017, there were an estimated 700 million active users on Instagram, our main social media platform for this research. As the number of users on social media platforms increases, a problem of great significance becomes clear: the increasing amount of negativi...

متن کامل

Nash equilibrium strategy in the deregulated power industry and comparing its lost welfare with Iran wholesale electricity market

With the increasing use of different types of auctions in market designing, modeling of participants’ behaviors to evaluate the market structure is one of the main discussions in the studies related to the deregulated power industries. In this article, we apply an approach of the optimal bidding behavior to the Iran wholesale electricity market as a restructured electric power industry and mode...

متن کامل

Non-Monotone Stochastic Generalized Porous Media Equations∗

By using the Nash inequality and a monotonicity approximation argument, existence and uniqueness of strong solutions are proved for a class of non-monotone stochastic generalized porous media equations. Moreover, we prove for a large class of stochastic PDE that the solutions stay in the smaller L2-space provided the initial value does, so that some recent results in the literature are consider...

متن کامل

Approximate Nash Equilibria with Near Optimal Social Welfare

It is known that Nash equilibria and approximate Nash equilibria not necessarily optimize social optima of bimatrix games. In this paper, we show that for every fixed ε > 0, every bimatrix game (with values in [0, 1]) has an ε-approximate Nash equilibrium with the total payoff of the players at least a constant factor, (1 − √ 1− ε), of the optimum. Furthermore, our result can be made algorithmi...

متن کامل

The Structure and Complexity of Extreme Nash Equilibria ?

We study extreme Nash equilibria in the context of a selfish routing game. Specifically, we assume a collection of n users, each employing a mixed strategy, which is a probability distribution over m parallel identical links, to control the routing of its own assigned traffic. In a Nash equilibrium, each user selfishly routes its traffic on those links that minimize its expected latency cost. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1703.09177  شماره 

صفحات  -

تاریخ انتشار 2017