Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion

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

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, we consider the bin packing problem both in the classic and parametric versions, the job scheduling pr…

Teams in Online Scheduling Polls: Game-Theoretic Aspects

Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken during the meeting, therefore each team would like to maximize its relative attendance in the meeting (i.e., the proportional number of its participating team members). We introduce a corresponding game, where each team can declare (in the scheduling poll) a lower total availability, in order to improve its relative attendance---the pay-off. We are especially …

一种可扩展的城市疏散路径规划与调度的博弈论方法

A Scalable Game-theoretic Approach to Urban Evacuation Routing and Scheduling

本文提出一种博弈论方法解决城市疏散路径规划与调度问题，构建了EGRES博弈模型证明纯策略纳什均衡的存在性，并提出多项式时间算法SAA在特殊条件下高效求解均衡，实验验证其社会目标接近最优值。

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games

We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design scheduling policies that always admit a pure Nash equilibrium and guarantee a small price of anarchy for the l_k-norm social cost --- the objective balances overall quality of service and fairness. We consider policies with different amount of knowledge about jobs: non-clairvoyant, strongly-local and local. The analysis relies on the smooth argument togethe…

Security Attacks on Smart Grid Scheduling and Their Defences: A Game-Theoretic Approach

The introduction of advanced communication infrastructure into the power grid raises a plethora of new opportunities to tackle climate change. This paper is concerned with the security of energy management systems which are expected to be implemented in the future smart grid. The existence of a novel class of false data injection attacks that are based on modifying forecasted demand data is demonstrated, and the impact of the attacks on a typical system's parameters is identified, using a simulated scenario. Monitoring strategies that the utility company may employ in order to detect the attac…

Open shop scheduling games

This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of operations) to a different player, we can construct a cooperative TU-game associated with any open shop scheduling problem. We assign to each coalition the maximal cost savings it can obtain through admissible rearrangements of jobs' operations. By providing a core allocation, we show that the associated games are balanced. Finally, we relax the definition of admissib…