We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Ric...
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
This paper clarifies two common patterns of multitasking on the Web, namely Multiple Tasks (MT) and Multiple Session Task (MST). To support both of these, the task concept needs t...