ScholarlyCommons

Title

Behavioral Conflict and Fairness in Social Networks

Author(s)

Stephen Judd, University of PennsylvaniaFollow
Michael J. Kearns, University of PennsylvaniaFollow
Yevgeniy Vorobeychik, Sandia National Laboratories

Date of this Version

12-2011

Document Type

Conference Paper

Recommended Citation

Stephen Judd, Michael J. Kearns, and Yevgeniy Vorobeychik, "Behavioral Conflict and Fairness in Social Networks", . December 2011.

Comments

Judd, S., Kearns, M., & Vorobeychik, Y., Behavioral Conflict and Fairness in Social Networks, Internet and Network Economies-7th International Workshop, WINE 2011, Dec. 2011, doi; 10.1007/978-3-642-25510-6_21

Copyright © 2011, Springer Berlin / Heidelberg

Abstract

We report on a series of behavioral experiments in social networks in which human subjects continuously choose to play either a dominant role (called a King) or a submissive one (called a Pawn). Kings receive a higher payoff rate, but only if all their network neighbors are Pawns, and thus the maximum social welfare states correspond to maximum independent sets. We document that fairness is of vital importance in driving interactions between players. First, we find that payoff disparities between network neighbors gives rise to conflict, and the specifics depend on the network topology. However, allowing Kings to offer "tips" or side payments to their neighbors substantially reduces conflict, and consistently increases social welfare. Finally, we observe that tip reductions lead to increased conflict. We describe these and a broad set of related findings.