{
  "abstract": "Inverse optimization problems focus on minimizing the adjustments made to the input data to achieve a desired outcome. Popular matchings are relaxations of stable matchings that prioritize the overall welfare of society over individual preferences. In this work, we aim to determine a minimum cost set of nodes in order to make a given matching popular by updating preferences at the chosen set. We show that the problem is NP-hard, even if the input matching is perfect or the graph is bipartite. If the desired matching is maximum size in the graph, we present a polynomial time algorithm to determine this minimum in bipartite graphs, and provide a dual characterization.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "name": "Erika Bérczi-Kovács"
    },
    {
      "name": "Eszter Szabó"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/059nae34prxgr.bib",
  "cited_by": 0,
  "doi": "10.37236/13747",
  "fulltext_url": null,
  "id": "059nae34prxgr",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p11",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "2002|Game Theory and Voting Systems"
    ]
  ],
  "openalex": "W7221026992",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p11/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/059nae34prxgr.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/13747",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p11"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "issn:1077-8926",
      "subfield": "combinatorics"
    }
  ],
  "title": "How to Secure General Acceptance for a Matching? - Inverse Popular Matchings",
  "title_text": "How to Secure General Acceptance for a Matching? - Inverse Popular Matchings",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/059nae34prxgr",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}