18 citations · 18 across the 5 of their papers we have counts for
5 papers
Testing popularity in linear time via maximum matching
Erika Bérczi-Kovács, Kata Kosztolányi
Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a…
Polynomially tractable cases in the popular roommates problem
Erika Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi +1
The input of the popular roommates problem consists of a graph and for each vertex , strict preferences over the neighbors of . Matching is more popular…
A dual approach for dynamic pricing in multi-demand markets
Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi
Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-ar…
Envy-free Relaxations for Goods, Chores, and Mixed Items
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros +5
In fair division problems, we are given a set of items and a set of agents with individual preferences, and the goal is to find an allocation of items among agents…
Network Coding Algorithms for Multi-Layered Video Broadcast
Erika R. Bérczi-Kovács, Zoltán Király
In this paper we give network coding algorithms for multi-layered video streaming. The problem is motivated by video broadcasting in a communication network to users with varying d…