Jan. 12, 2016, 10:15 a.m.

Tuesday 10:15-12:00, room 310.

Abstract. I will tell you what I did during my research internship in Athens. We investigate a problem of pricing vertices in social network with inequity aversion. Each vertex has its revenue function. We need to set prices for which we maximize total revenue (sum of revenues from each vertex). There is a restriction for maximal difference between proposed prices for neighbors (inequity aversion). The model was extended in few ways. We proved NP-hardness of the most natural model and we gave few approximation algorithms. Also we improve approximation ratio for graphs with maximal degree D.