Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/8201
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÇaşkurlu, B.-
dc.contributor.authorKızılkaya, F.E.-
dc.contributor.authorÖzen, B.-
dc.date.accessioned2022-01-15T13:00:36Z-
dc.date.available2022-01-15T13:00:36Z-
dc.date.issued2021-
dc.identifier.isbn9783030859466-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://doi.org/10.1007/978-3-030-85947-3_21-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/8201-
dc.description14th International Symposium on Algorithmic Game Theory, SAGT 2021 -- 21 September 2021 through 24 September 2021 -- 265329en_US
dc.description.abstractWe consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as a hedonic game, and we show that this class of games possesses many desirable properties, some of which are as follows: A partition that is Nash stable, core stable and Pareto optimal is always guaranteed to exist. A contractually individually stable partition (and a Nash stable partition in a restricted setting) can be found in polynomial-time. A core stable partition can be approximated within a factor of 1-1e and this bound is tight. We discover a larger and relatively general class of hedonic games, where the above existence guarantee holds. For this larger class, we present simple dynamics that converge to a Nash stable partition in a relatively low number of moves. © 2021, Springer Nature Switzerland AG.en_US
dc.language.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCommon ranking propertyen_US
dc.subjectHedonic gamesen_US
dc.subjectTeam formationen_US
dc.subjectPareto principleen_US
dc.subjectCommon ranking propertyen_US
dc.subjectGeneral classen_US
dc.subjectGlobal seten_US
dc.subjectHedonic gamesen_US
dc.subjectNash stable partitionsen_US
dc.subjectPareto-optimalen_US
dc.subjectPolynomial-timeen_US
dc.subjectPropertyen_US
dc.subjectSimple++en_US
dc.subjectTeam formationen_US
dc.subjectPolynomial approximationen_US
dc.titleHedonic Expertise Gamesen_US
dc.typeConference Objecten_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümütr_TR
dc.identifier.volume12885 LNCSen_US
dc.identifier.startpage314en_US
dc.identifier.endpage328en_US
dc.identifier.scopus2-s2.0-85115842410en_US
dc.institutionauthorÇaşkurlu, Buğra-
dc.identifier.doi10.1007/978-3-030-85947-3_21-
dc.authorscopusid35104543000-
dc.authorscopusid55908061300-
dc.authorscopusid57275075200-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ2-
item.openairetypeConference Object-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

66
checked on Dec 23, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.