Back to Results
First PageMeta Content
Cooperative game / Problem solving / Pareto efficiency / Science / Game theory / Economics / Core


Computing Desirable Partitions in Additively Separable Hedonic Games Haris Aziz, Felix Brandt∗, Hans Georg Seedig Institut f¨ ur Informatik, Technische Universit¨ at M¨
Add to Reading List

Document Date: 2011-12-07 11:52:18

Open Document

File Size: 426,23 KB

Share Result on Facebook

/

Facility

Nash stable / /

IndustryTerm

polynomial-time algorithm / computing / multiagent systems / individual utilities / possible solution / social networking / polynomialtime algorithms / /

Organization

Hans Georg Seedig Institut f¨ / NS SC / Si / /

Person

Felix Brandt / Hans Georg Seedig / Haris Aziz / /

Position

incoming player / needed player / leader / player / particular player / arbitrary player / Corresponding author / /

ProvinceOrState

Saskatchewan / /

Technology

7 Algorithm / 9 Algorithm / artificial intelligence / known polynomialtime algorithms / polynomial-time algorithm / /

SocialTag