Skip to main content

2017 | OriginalPaper | Buchkapitel

On Proportional Allocation in Hedonic Games

verfasst von : Martin Hoefer, Wanchote Jiamjitrak

Erschienen in: Algorithmic Game Theory

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Proportional allocation is an intuitive and widely applied mechanism to allocate divisible resources. We study proportional allocation for profit sharing in coalition formation games. Here each agent has an impact or reputation value, and each coalition represents a joint project that generates a total profit. This profit is divided among the agents involved in the project based on their reputation. We study existence, computational complexity, and social welfare of core-stable states with proportional sharing.
Core-stable states always exist and can be computed in time \(O(m \log m)\), where m is the total number of projects. Moreover, when profits have a natural monotonicity property, there exists a reputation scheme such that the price of anarchy is 1, i.e., every core-stable state is a social optimum. However, these schemes exhibit a strong inequality in reputation of agents and thus imply a lacking fairness condition. Our main results show a tradeoff between reputation imbalance and the price of anarchy. Moreover, we show lower bounds and computational hardness results on the reputation imbalance when prices of anarchy and stability are small.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Core-stability usually means that no subset of agents wants to deviate. We recover this interpretation when we assume all coalitions \(c \in 2^V \setminus C\) have profit \(w(c) = -1\).
 
Literatur
1.
3.
Zurück zum Zitat Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316–334 (2013)MathSciNetCrossRef Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316–334 (2013)MathSciNetCrossRef
4.
Zurück zum Zitat Birnbaum, B., Devanur, N., Xiao, L.: Distributed algorithms via gradient descent for fisher markets. In: Proceedings of 12th Conference Electronic Commerce (EC), pp. 127–136 (2011) Birnbaum, B., Devanur, N., Xiao, L.: Distributed algorithms via gradient descent for fisher markets. In: Proceedings of 12th Conference Electronic Commerce (EC), pp. 127–136 (2011)
5.
Zurück zum Zitat Branzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: Proceedings of 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 79–84 (2009) Branzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: Proceedings of 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 79–84 (2009)
6.
Zurück zum Zitat Caragiannis, I., Voudouris, A.: Welfare guarantees for proportional allocations. Theory Comput. Syst. 59(4), 581–599 (2016)MathSciNetCrossRef Caragiannis, I., Voudouris, A.: Welfare guarantees for proportional allocations. Theory Comput. Syst. 59(4), 581–599 (2016)MathSciNetCrossRef
7.
Zurück zum Zitat Cechlárova, K.: Stable partition problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1–99. Springer, New York (2008) Cechlárova, K.: Stable partition problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1–99. Springer, New York (2008)
8.
Zurück zum Zitat Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. Theory Comput. Syst. 59(4), 600–618 (2016)MathSciNetCrossRef Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. Theory Comput. Syst. 59(4), 600–618 (2016)MathSciNetCrossRef
9.
Zurück zum Zitat Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751–766 (1999)MathSciNetCrossRef Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751–766 (1999)MathSciNetCrossRef
10.
Zurück zum Zitat Dreze, J., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987–1003 (1980)MathSciNetCrossRef Dreze, J., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987–1003 (1980)MathSciNetCrossRef
11.
Zurück zum Zitat Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174–185. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16170-4_16CrossRef Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174–185. Springer, Heidelberg (2010). doi:10.​1007/​978-3-642-16170-4_​16CrossRef
12.
13.
Zurück zum Zitat Håstad, J.: Clique is hard to approximate within \(n^{1-\varepsilon }\). Acta Math. 182(1), 105–142 (1999)MathSciNetCrossRef Håstad, J.: Clique is hard to approximate within \(n^{1-\varepsilon }\). Acta Math. 182(1), 105–142 (1999)MathSciNetCrossRef
15.
Zurück zum Zitat Johari, R., Tsitsiklis, J.: Efficiency loss in a resource allocation game. Math. Oper. Res. 29(3), 407–435 (2004)MathSciNetCrossRef Johari, R., Tsitsiklis, J.: Efficiency loss in a resource allocation game. Math. Oper. Res. 29(3), 407–435 (2004)MathSciNetCrossRef
16.
Zurück zum Zitat Kleinberg, J., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proceedings of 43rd Symposium on Theory of Computing (STOC), pp. 529–538 (2011) Kleinberg, J., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proceedings of 43rd Symposium on Theory of Computing (STOC), pp. 529–538 (2011)
17.
Zurück zum Zitat Peters, D.: Graphical hedonic games of bounded treewidth. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 586–593 (2016) Peters, D.: Graphical hedonic games of bounded treewidth. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 586–593 (2016)
18.
Zurück zum Zitat Peters, D.: Towards structural tractability in hedonic games. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 4252–4253 (2016) Peters, D.: Towards structural tractability in hedonic games. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 4252–4253 (2016)
19.
Zurück zum Zitat Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 617–623 (2015) Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 617–623 (2015)
21.
Zurück zum Zitat Sung, S.-C., Dimitrov, D.: Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3), 635–639 (2010)MathSciNetCrossRef Sung, S.-C., Dimitrov, D.: Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3), 635–639 (2010)MathSciNetCrossRef
22.
Zurück zum Zitat Zhang, L.: Proportional response dynamics in the fisher market. Theor. Comput. Sci. 412(24), 2691–2698 (2011)MathSciNetCrossRef Zhang, L.: Proportional response dynamics in the fisher market. Theor. Comput. Sci. 412(24), 2691–2698 (2011)MathSciNetCrossRef
Metadaten
Titel
On Proportional Allocation in Hedonic Games
verfasst von
Martin Hoefer
Wanchote Jiamjitrak
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-66700-3_24

Premium Partner