Results 1  10
of
130
MultiDimensional EnvyFree Scheduling Mechanisms
"... We study fairness design scenarios in which each bidder follows the global goal of the mechanism designer only if the resulted allocation would be fair from his own point of view. More formally, we focus on approximation algorithms for indivisible items with supporting envyfree bundle prices. We f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
consider the important case of related parallel machines and show the envyfreeness constraint do not impose an additional computational burden. 0 1
M.: The Price of Anarchy for Minsum Related Machine Scheduling
 WAOA 2011. LNCS
, 2012
"... Abstract. We address the classical uniformly related machine scheduling problem with minsum objective. The problem is solvable in polynomial time by the algorithm of Horowitz and Sahni. In that solution, each machine sequences its jobs shortest first. However when jobs may choose the machine on wh ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
is bounded from above by 2. We also give a lower bound of e/(e − 1) ≈ 1.58. This complements recent results on the price of anarchy for the more general unrelated machine scheduling problem, where the price of anarchy equals 4. Interestingly, as Nash equilibria coincide with shortest processing time first
A PriceAnticipating Resource Allocation Mechanism for Distributed Shared
 Clusters”, 6th ACM Conference on Electronic Commerce
, 2005
"... In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide how to distribute their budget (bids) among multiple machines according to their individual preferences to maximize their ..."
Abstract

Cited by 46 (8 self)
 Add to MetaCart
their individual utility. We look at both the efficiency and the fairness of the allocation at the equilibrium, where fairness is evaluated through the measures of utility uniformity and envyfreeness. We show analytically and through simulations that despite being highly decentralized, such a system converges
Sequential Scheduling on Identical Machines
, 2014
"... We study a sequential version of the wellknown KPmodel: Each of n agents has a job that needs to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the finish time of his machine. We study the corresponding seque ..."
Abstract
 Add to MetaCart
sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insights into the case of two unrelated machines. Keywords: sequential price of anarchy, machine scheduling, congestion games, load balancing, subgameperfect equilibrium, makespan minimization. 1
Strong Price of Anarchy
"... A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst case strong equilibrium to the social optimum. In contrast to the traditional price of anarchy, which quantifies the loss i ..."
Abstract

Cited by 73 (10 self)
 Add to MetaCart
scheduling game we show that for unrelated machines the strong price of anarchy can be bounded as a function of the number of machines and the size of the coalition. For the network creation game we show that the strong price of anarchy is at most 2. In both cases we show that a strong
Coordination Mechanisms for Selfish Scheduling
, 2006
"... In machine scheduling, a set of jobs must be scheduled on a set of machines so as to minimize some global objective function, such as the makespan considered in this paper. In practice, jobs are often controlled by independent, selfishly acting agents, each of which selects a machine for processing ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
of these games may result in largerthanoptimal overall makespan. The price of anarchy is the ratio of the worstcase equilibrium makespan to the optimal makespan. In this paper, we design and analyze scheduling policies, or coordination mechanisms, for machines which aim to minimize the price of anarchy
Parallel Machine Scheduling By Column Generation
, 1995
"... Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP hard, but also very hard from a practical point of view. In this paper, we show that strong an ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. To that end, we formulate these parallel machine scheduling problems as a set covering problems with an exponential number of binary variables, n covering constraints, and a single side constraint. We show that the linear programming relaxation can be solved efficiently by column generation, since the pricing
Efficient coordination mechanisms for unrelated machine scheduling
 In: Proc. AMCSIAM SODA
, 2009
"... We present three new coordination mechanisms for scheduling n selfish jobs on m unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of jobs on the efficiency of schedules by defining a local scheduling policy on each machine. The scheduling policies induce a game ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We present three new coordination mechanisms for scheduling n selfish jobs on m unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of jobs on the efficiency of schedules by defining a local scheduling policy on each machine. The scheduling policies induce a game
Automated strategy searches in an electronic goods market: Learning and complex price schedules
 In Proceedings of ACM EC99
, 1999
"... In an automated market for electronic goods problems arise that have not been well studied previously. For example, information goods are very flexible. In contrast to physical goods, marginal costs are negligible and nearly limitless bundling and unbundling of these items are possible. Consequently ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
through market experience. In this paper we compare dynamic performance across price schedules of varying complexity. We provide the producer with two machine learning
HalfPrice Architecture
 In Proceedings of the International Symposium on Computer Architecture
, 2003
"... Currentgeneration microprocessors are designed to process instructions with one and two source operands at equal cost. Handling two source operands requires multiple ports for each instruction in structuressuch as the register file and wakeup logicwhich are often in the processor critical timi ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
is sequential register access, which halves the register read ports by sequentially accessing two values using a single port when needed. We show that a pipeline that optimizes scheduling and register access for a single operand achieves nearly the same performance as an ideal base machine that fully handles
Results 1  10
of
130