• Corpus ID: 10309862

Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective

  title={Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective},
  author={Elena Kleiman},
Many packing, scheduling and covering problems that were previously considered by computer science literature in the context of various transportation and production problems, appear also suitable for describing and modeling various fundamental aspects in networks optimization such as routing, resource allocation, congestion control, etc. Various combinatorial problems were already studied from the game theoretic standpoint, and we attempt to complement to this body of research. Specifically… 

Inefficiency of equilibria for the machine covering game on uniform machines

The problem of measuring the inefficiency of equilibria on two uniform machines is completely solved, and the Price of Stability and Price of Anarchy are presented as a function of s, the ratio of the speeds of the two machines.

Maximizing the minimum load: The cost of selfishness

The cost of selfishness for maximizing the minimum load on uniformly related machines

The price of anarchy (poa) and the price of stability (pos) for uniformly related machines are studied and it is shown that while the poa grows to infinity as s tends to 2, the pos is at most 2 for any s≤2.

Towards Bin Packing (preliminary problem survey, models with multiset estimates)

A generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items are described.



Non-cooperative facility location and covering games

Covering Games: Approximation through Non-cooperation

It is proved that any sequence of unilateral improving steps is polynomially bounded and gives rise to a polynomial-time local search approximation algorithm whose approximation ratio is best possible.

On the quality and complexity of pareto equilibria in the job scheduling game

A complete classification of the social quality of such solutions with respect to an optimal solution is given, that is, the Price of Anarchy of such schedules as a function of the number of machines, m.

(Almost) optimal coordination mechanisms for unrelated machine scheduling

A local ordering policy with the approximation ratio of Θ(log m) in equilibria is designed, and it is proved that this policy is optimal among all local ordering policies, and closes the gap between the known lower and upper bounds for this problem.

On the Complexity of Pareto-Optimal Nash and Strong Equilibria

This work considers the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games, and shows that recognition and computation of both concepts can be done efficiently.

The structure and complexity of Nash equilibria for a selfish routing game

This work provides a comprehensive collection of efficient algorithms, hardness results (both as NP-hardness and #P-completeness results), and structural results for these algorithmic problems related to the computation of Nash equilibria for the selfish routing game the authors consider.

Coordination mechanisms for selfish scheduling

Distributed selfish bin packing

A game-theoretic bin packing problem with identical items, and the convergence time to a Nash equilibrium is studied, and two approaches are considered, depending if the system can undo movements that lead to infeasible states.

On allocations that maximize fairness

This work considers a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods, and presents a rounding technique that recovers an allocation of value at least Ω(log log log m/log log m) of the optimum.