EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"popular matching"
Narrow search

Narrow search

Year of publication
Subject
All
popular matching 8 polynomial algorithm 6 NP-completeness 4 stable matching 4 Algorithm 3 Algorithmus 3 Matching 3 NP-complete 2 dominant matching 2 matching under preferences 2 ties 2 Graph theory 1 Graphentheorie 1 Präferenztheorie 1 Search theory 1 Social network 1 Soziales Netzwerk 1 Suchtheorie 1 Theorie 1 Theory 1 Theory of preferences 1
more ... less ...
Online availability
All
Free 8
Type of publication
All
Book / Working Paper 8
Type of publication (narrower categories)
All
Working Paper 8 Arbeitspapier 4 Graue Literatur 4 Non-commercial literature 4
Language
All
English 8
Author
All
Cseh, Ágnes 8 Kavitha, Telikepalli 8 Faenza, Yuri 2 Powers, Vladlena 2 Huang, Chien-Chung 1 Huang, Chien-chung 1
Published in...
All
CERS-IE Working Papers 2 IEHAS Discussion Papers 2 KRTK-KTI working papers : KRTK-KTI WP 2 Mu̐helytanulmányok / Magyar Tudományos Akadémia, Közgazdaságtudományi Intézet 2
Source
All
ECONIS (ZBW) 4 EconStor 4
Showing 1 - 8 of 8
Cover Image
Understanding popular matchings via stable matchings
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; … - 2020
against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of … popular matchings that always exist and can be easily computed is the set of dominant matchings. A popular matching M is … dominant if M wins the head-to-head election against any larger matching. Thus every dominant matching is a max-size popular …
Persistent link: https://www.econbiz.de/10012290306
Saved in:
Cover Image
Popular matchings in complete graphs
Cseh, Ágnes; Kavitha, Telikepalli - 2020
not. The popular matching problem in Gis easy to solve for odd n. Surprisingly, the problem becomes NP-hard for even n, as …
Persistent link: https://www.econbiz.de/10012290307
Saved in:
Cover Image
Understanding popular matchings via stable matchings
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; … - 2020
against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of … popular matchings that always exist and can be easily computed is the set of dominant matchings. A popular matching M is … dominant if M wins the head-to-head election against any larger matching. Thus every dominant matching is a max-size popular …
Persistent link: https://www.econbiz.de/10012211535
Saved in:
Cover Image
Popular matchings in complete graphs
Cseh, Ágnes; Kavitha, Telikepalli - 2020
not. The popular matching problem in Gis easy to solve for odd n. Surprisingly, the problem becomes NP-hard for even n, as …
Persistent link: https://www.econbiz.de/10012211577
Saved in:
Cover Image
Popular matchings with two-sided preferences and one-sided ties
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli - 2017
vertices that prefer M to M'. We show that the problem of deciding whether G admits a popular matching or not is NP-hard. This …
Persistent link: https://www.econbiz.de/10011944920
Saved in:
Cover Image
Popular edges and dominant matchings
Cseh, Ágnes; Kavitha, Telikepalli - 2017
matchings called "dominant matchings" and show that if there is a popular matching that contains the edge e, then there is … popular matching containing a given set of edges or report that none exists, where n = …Given a bipartite graph G=(A B, E) with strict preference lists and given an edge e E, we ask if there exists a popular …
Persistent link: https://www.econbiz.de/10011944922
Saved in:
Cover Image
Popular matchings with two-sided preferences and one-sided ties
Cseh, Ágnes; Huang, Chien-chung; Kavitha, Telikepalli - 2017
vertices that prefer M to M'. We show that the problem of deciding whether G admits a popular matching or not is NP-hard. This …(n2) algorithm (where n = |A B|) for the popular matching problem in this model. Note that this model is quite different …
Persistent link: https://www.econbiz.de/10011757166
Saved in:
Cover Image
Popular edges and dominant matchings
Cseh, Ágnes; Kavitha, Telikepalli - 2017
matchings called "dominant matchings" and show that if there is a popular matching that contains the edge e, then there is … popular matching containing a given set of edges or report that none exists, where n = |A| + |B|. …Given a bipartite graph G=(A B, E) with strict preference lists and given an edge e E, we ask if there exists a popular …
Persistent link: https://www.econbiz.de/10011757266
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...