FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2268996910> ?p ?o ?g. }

• W2268996910 abstract "We investigate computational aspects of popular solution concepts for different models of network games. In chapter 3 we study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We fully characterize the existence of balanced solutions and provide the first polynomial time algorithm for their computation. Our methods use a new idea of reducing an instance with general capacities to an instance with unit capacities defined on an auxiliary graph. This chapter is an extended version of the conference paper [32]. In chapter 4 we propose a generalization of the classical stable marriage problem. In our model the preferences on one side of the partition are given in terms of arbitrary binary relations, that need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, encompasses the well studied hard variant of stable marriage where preferences are allowed to have ties and to be incomplete. Our main result shows that deciding the existence of a stable matching in our model is NP-complete. We then use our model to study a long standing open problem about cyclic 3D stable matchings. In particular, we prove that deciding whether a fixed 2D perfect matching can be extended to a 3D stable matching is NP-complete. This chapter is an extended version of the conference paper [33]. In chapter 5 we study a long standing open problem of whether the nucleolus of matching games can be computed efficiently. Our approach follows previous techniques that rely on obtaining a polynomial sized characterization of the least core as both the initial and crucial step in establishing an efficient algorithm. As a preliminary result, we introduce a generalisation of the least core and show that for node-weighted matching games existing polynomial sized characterizations of the least core can be extended to this generalised version. We then use this result to show that for a certain class games with general weights one can identify a node-weighted subgraph such that the least core of the original matching game is equal to the generalised least core of this subgraph. This allows us to obtain a polynomial time algorithm for computing the nucleolus for this class of matching games with general weights." @default.
• W2268996910 created "2016-06-24" @default.
• W2268996910 creator A5068381762 @default.
• W2268996910 date "2015-08-20" @default.
• W2268996910 modified "2023-09-23" @default.
• W2268996910 title "Matchings and games on networks" @default.
• W2268996910 cites W1485350598 @default.
• W2268996910 cites W1489001902 @default.
• W2268996910 cites W1493066352 @default.
• W2268996910 cites W1538521242 @default.
• W2268996910 cites W1549171560 @default.
• W2268996910 cites W1563534733 @default.
• W2268996910 cites W1582786183 @default.
• W2268996910 cites W1609615991 @default.
• W2268996910 cites W1900044096 @default.
• W2268996910 cites W1925442871 @default.
• W2268996910 cites W1966010233 @default.
• W2268996910 cites W1979862606 @default.
• W2268996910 cites W1986927971 @default.
• W2268996910 cites W1987344946 @default.
• W2268996910 cites W1989936306 @default.
• W2268996910 cites W1992351112 @default.
• W2268996910 cites W2002430844 @default.
• W2268996910 cites W2009925124 @default.
• W2268996910 cites W2011268914 @default.
• W2268996910 cites W2017990047 @default.
• W2268996910 cites W2029062013 @default.
• W2268996910 cites W2029140075 @default.
• W2268996910 cites W2038927822 @default.
• W2268996910 cites W2046116913 @default.
• W2268996910 cites W2048888597 @default.
• W2268996910 cites W2053711501 @default.
• W2268996910 cites W2054639940 @default.
• W2268996910 cites W2059209074 @default.
• W2268996910 cites W2059608229 @default.
• W2268996910 cites W2062070505 @default.
• W2268996910 cites W2063810092 @default.
• W2268996910 cites W2067156936 @default.
• W2268996910 cites W2067288168 @default.
• W2268996910 cites W2068115726 @default.
• W2268996910 cites W2070564800 @default.
• W2268996910 cites W2071503214 @default.
• W2268996910 cites W2073547397 @default.
• W2268996910 cites W2074062423 @default.
• W2268996910 cites W2080430389 @default.
• W2268996910 cites W2083438425 @default.
• W2268996910 cites W2095374113 @default.
• W2268996910 cites W2096867163 @default.
• W2268996910 cites W2100440346 @default.
• W2268996910 cites W2102152964 @default.
• W2268996910 cites W2113370239 @default.
• W2268996910 cites W2113501244 @default.
• W2268996910 cites W2115064460 @default.
• W2268996910 cites W2121619875 @default.
• W2268996910 cites W2123530939 @default.
• W2268996910 cites W2125363721 @default.
• W2268996910 cites W2131227819 @default.
• W2268996910 cites W2133200215 @default.
• W2268996910 cites W2133953743 @default.
• W2268996910 cites W2144220809 @default.
• W2268996910 cites W2153000253 @default.
• W2268996910 cites W2159191017 @default.
• W2268996910 cites W2159433410 @default.
• W2268996910 cites W2229001197 @default.
• W2268996910 cites W2327315803 @default.
• W2268996910 cites W2333270118 @default.
• W2268996910 cites W2398700141 @default.
• W2268996910 cites W2481905440 @default.
• W2268996910 cites W2486813313 @default.
• W2268996910 cites W2949329320 @default.
• W2268996910 cites W2951017312 @default.
• W2268996910 cites W3137934641 @default.
• W2268996910 cites W568087019 @default.
• W2268996910 cites W2150482096 @default.
• W2268996910 hasPublicationYear "2015" @default.
• W2268996910 type Work @default.
• W2268996910 sameAs 2268996910 @default.
• W2268996910 citedByCount "0" @default.
• W2268996910 crossrefType "dissertation" @default.
• W2268996910 hasAuthorship W2268996910A5068381762 @default.
• W2268996910 hasConcept C105795698 @default.
• W2268996910 hasConcept C114614502 @default.
• W2268996910 hasConcept C118615104 @default.
• W2268996910 hasConcept C126255220 @default.
• W2268996910 hasConcept C134306372 @default.
• W2268996910 hasConcept C144237770 @default.
• W2268996910 hasConcept C146393371 @default.
• W2268996910 hasConcept C165064840 @default.
• W2268996910 hasConcept C177148314 @default.
• W2268996910 hasConcept C191399111 @default.
• W2268996910 hasConcept C311688 @default.
• W2268996910 hasConcept C33923547 @default.
• W2268996910 hasConcept C41008148 @default.
• W2268996910 hasConcept C42812 @default.
• W2268996910 hasConcept C65180967 @default.
• W2268996910 hasConcept C80444323 @default.
• W2268996910 hasConceptScore W2268996910C105795698 @default.
• W2268996910 hasConceptScore W2268996910C114614502 @default.
• W2268996910 hasConceptScore W2268996910C118615104 @default.
• W2268996910 hasConceptScore W2268996910C126255220 @default.

• next