Related papers: Open shop scheduling games
We study the approximability of two related machine scheduling problems. In the late work minimization problem, there are identical parallel machines and the jobs have a common due date. The objective is to minimize the late work, defined…
In this paper, we propose and analyse two game theoretical models useful to design marketing channels attribution mechanisms based on cooperative TU games and bankruptcy problems, respectively. First, we analyse the Sum Game, a coalitional…
We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling…
Agricultural industries face increasing pressure to optimize efficiency and reduce costs in a competitive and resource-constrained global market. As firms seek innovative ways to enhance productivity, cooperative strategies have emerged as…
We study fair allocation of profit (or cost) for three central problems from combinatorial optimization: Max-Flow, MST and $b$-matching. The essentially unequivocal choice of solution concept for this purpose would be the core, because of…
In many multiagent scenarios, agents distribute resources, such as time or energy, among several tasks. Having completed their tasks and generated profits, task payoffs must be divided among the agents in some reasonable manner. Cooperative…
We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the…
Budget aggregation deals with the social choice problem of distributing an exogenously given budget among a set of public projects, given agents' preferences. Taking a game-theoretic perspective, we study budget-aggregation games where each…
We analyse a coalition formation game between strategic service providers of a congestible service. The key novelty of our formulation is that it is a constant sum game, i.e., the total payoff across all service providers (or coalitions of…
This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…
We revisit games in partition function form, i.e. cooperative games where the payoff of a coalition depends on the partition of the entire set of players. We assume that each coalition computes its worth having probabilistic beliefs over…
This paper proposes a framework and solution concept for repeated coalitional behavior. We model history-dependent schemes that deter coalitions from blocking using continuation promises and punishments. We evaluate the effectiveness of…
The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal…
The coordination of actions and the allocation of profit in supply chains under decentralized control play an important role in improving the profits of retailers and suppliers in the chain. We focus on supply chains under decentralized…
In classical job-scheduling games, each job behaves as a selfish player, choosing a machine to minimize its own completion time. To reduce the equilibria inefficiency, coordination mechanisms are employed, allowing each machine to follow…
Machine scheduling problems involving conflict jobs can be seen as a constrained version of the classical scheduling problem, in which some jobs are conflict in the sense that they cannot be proceeded simultaneously on different machines.…
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachability-time games on strongly…
Team assembly is a problem that demands trade-offs between multiple fairness criteria and computational optimization. We focus on four criteria: (i) fair distribution of workloads within the team, (ii) fair distribution of skills and…
This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that constitutes a…
In this work we study the problem of user association and resource allocation to maximize the proportional fairness of a wireless network with limited backhaul capacity. The optimal solution of this problem requires solving a mixed integer…