activity
20122019
most citedPareto-optimal Nash equilibrium in capacity allocation game for self-managed networks

21 citations · 21 across the 4 of their papers we have counts for

collaborators

6 papers

cs.DM2019

Robust Approach to Restricted Items Selection Problem

Maciej Drwal

We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combin…

cs.DS2017

Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty

Maciej Drwal

We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not…

cs.DM2017

Min-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With Interval Uncertainty

Maciej Drwal

We study the single machine scheduling problem with the objective to minimize the total weight of late jobs. It is assumed that the processing times of jobs are not exactly known a…

cs.GT2016

Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods

Maciej Drwal

In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on sto…

cs.DS2014

Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion

Maciej Drwal, Roman Rischke

In this paper, we consider the problem of scheduling jobs on parallel identical machines, where the processing times of jobs are uncertain: only interval bounds of processing times…

cs.GT2012★ 21 cited

Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks

Dariusz Gcasior, Maciej Drwal

In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by…