The matching game is played in a bipartite graph G = (V1, V2, E) in which edges are connect only vertices Vị to vertices in V2. The players are the vertices in the graph that is Vị U V2. Each player has to select one of its neighbors. Player i gets utility 1 when the selection is mutual (player i selects j and player j selects i) otherwise he gets 0. Provide a formal characterization of the strategy profiles that are pure Nash equilibrium of the matching game. Analyze the complexity of the problems related to pure Nash equilibria for this family of games.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
4. The matching game is played in a bipartite graph G = (V1, V2, E) in which edges are connect
only vertices Vị to vertices in V2. The players are the vertices in the graph that is Vi U V2.
Each player has to select one of its neighbors. Player i gets utility 1 when the selection is
mutual (player i selects j and player j selects i) otherwise he gets 0.
Provide a formal characterization of the strategy profiles that are pure Nash equilibrium of
the matching game. Analyze the complexity of the problems related to pure Nash equilibria
for this family of games.
Transcribed Image Text:4. The matching game is played in a bipartite graph G = (V1, V2, E) in which edges are connect only vertices Vị to vertices in V2. The players are the vertices in the graph that is Vi U V2. Each player has to select one of its neighbors. Player i gets utility 1 when the selection is mutual (player i selects j and player j selects i) otherwise he gets 0. Provide a formal characterization of the strategy profiles that are pure Nash equilibrium of the matching game. Analyze the complexity of the problems related to pure Nash equilibria for this family of games.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY