Schlotter Ildikó és Cseh Ágnes új tanulmánya megjelent az ACM Transactions on Computation Theory szakfolyóiratban
Maximum-utility Popular Matchings with Bounded Instability Ildikó Schlotter – Ágnes Cseh ACM Transactions on Computation Theory, Volume 17, Issue 1Article No.: 6, Pages 1 – 35 – Published: 08 March 2025 Abstract In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head […]
