We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
Thomas Voice, Maria Polukarov, Andrew Byde, Nichol...
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...