Bribery and Control in Stable Marriage (Q5154751): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197398676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of the stable roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness of stable marriage matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable marriage problem with ties and restricted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the uniqueness of stable marriage matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control and Bribery in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Fast Algorithms for Four Problems in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard variants of stable marriage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economics of Matching: Stability and Incentives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications / rank
 
Normal rank

Latest revision as of 19:23, 26 July 2024

scientific article; zbMATH DE number 7406487
Language Label Description Also known as
English
Bribery and Control in Stable Marriage
scientific article; zbMATH DE number 7406487

    Statements

    Bribery and Control in Stable Marriage (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 October 2021
    0 references
    0 references
    game theory
    0 references
    preferences
    0 references
    0 references