279 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Corvinus University of BudapestHU20 papers
- Budapest University of Technology and EconomicsHU9 papers
- Hungarian Academy of SciencesHU9 papers
- Institute of EconomicsRU9 papers
- Eötvös Loránd UniversityHU7 papers
- Complexity Science HubAT6 papers
- HUN-REN Institute for Computer Science and ControlHU5 papers
- Central European University - Budapest Campus4 papers
- Institute for Scientific InterchangeIT3 papers
- International Business SchoolHU3 papers
- University College LondonGB3 papers
- University of ExeterGB3 papers
4 papers · 1 filter
Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
Jörg Rothe, Ildikó Schlotter
Hedonic games -- at the interface of cooperative game theory and computational social choice -- are coalition formation games in which the players have preferences over the coaliti…
Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks
Dávid Csercsik, Eduard Jorswieck
We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial…
Resource-monotonicity and Population-monotonicity in Connected Cake-cutting
Erel Segal-Halevi, Balázs Sziklai
In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way --- giving each age…
Monotonicity and Competitive Equilibrium in Cake-cutting
Erel Segal-Halevi, Balázs Sziklai
We study the monotonicity properties of solutions in the classic problem of fair cake-cutting --- dividing a heterogeneous resource among agents with different preferences. Resourc…