Given a graph 
and a set 
of 
terminal vertices, a multiway-cut is a set 
of edges such that in 
, no path exists between any two nodes of 
. The multiway-cut problem is defined as finding the multiway-cut where 
is minimal. Multi-way cut terminal problem is known to be NP-hard for 
.
Again, using approximation we can make a faster algorithm.
“In game theory, a correlated equilibrium is a solution concept that is more general than the well known Nash equilibrium. It was first discussed by mathematician Robert Aumann (1974). The idea is that each player chooses his/her action according to his/her observation of the value of the same public signal. A strategy assigns an action to every possible observation a player can make. If no player would want to deviate from the recommended strategy (assuming the others don’t deviate), the distribution is called a correlated equilibrium.” – from Wikipedia
In the following case of study, the concepts of game theory, Nash equilibrium and correlated equilibrium are used to reach the goal.
Create a website and earn with Altervista - Disclaimer - Report Abuse - Privacy Policy - Customize advertising tracking