Schlotter Ildikó és szerzőtársai cikke megjelent a Mathematical Social Sciences folyóiratban
Computational complexity of necessary envy-freeness Haris Aziz, Ildikó Schlotter, Toby Walsh Mathematical Social Sciences – Volume 127, January 2024, Pages 86-98 Highlights Envy-free allocation of indivisible items to a few agents is computationally hard. Finding a necessarily envy-free allocation is NP-hard already for 3 agents. For any n ≥ 3 , […]
Csontos Tamás és Lakócai Csaba tanulmányai megjelentek a Global Economic Observer folyóiratban
Global Economic Observe No. 2, Vol. 11 / 2023 SPATIAL DYNAMICS OF REGIONAL COMPETITIVENESS IN CENTRAL AND EASTERN EUROPE Csaba Lakócai, Luigi Capoani Abstract Our study examines the territorial structure of 11 Central and Eastern European (CEE) Member States of the EU in NUTS 2 regional breakdown, considering […]
