Results 1  10
of
400
The price of stability for network design with fair cost allocation
 In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS
, 2004
"... Abstract. Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of selfinterested agents who want to form a network connecting certain endpoints, the set of stable solutions — the Nash equilibria — may look quite differ ..."
Abstract

Cited by 281 (30 self)
 Add to MetaCart
that can be proposed from which no user will defect. We consider the price of stability for network design with respect to one of the most widelystudied protocols for network cost allocation, in which the cost of each edge is divided equally between users whose connections make use of it; this fair
CoreStateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
, 1998
"... Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complex ..."
Abstract

Cited by 251 (11 self)
 Add to MetaCart
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis
CoreStateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
, 2003
"... Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complex ..."
Abstract

Cited by 136 (0 self)
 Add to MetaCart
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis
On approximately fair cost allocation in Euclidean TSP games
, 1996
"... We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisfies the triangle inequality. We thereby use the model of TSP games in the sens ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisfies the triangle inequality. We thereby use the model of TSP games
A Fair Share Scheduler.
 Communications of the ACM
, 1988
"... CPU schedulers are usually designed to allocate resources fairly among processes. In this paper, we describe Share, a scheduler that allocates resources so that users get their fair machine share over a long period. We also describe an hierarchical form of Share that supports sharing, not only betwe ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
CPU schedulers are usually designed to allocate resources fairly among processes. In this paper, we describe Share, a scheduler that allocates resources so that users get their fair machine share over a long period. We also describe an hierarchical form of Share that supports sharing, not only
On the price of stability for designing undirected networks with fair cost allocations
 IN PROCEEDINGS OF THE 33RD ANNUAL INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP
, 2006
"... In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. We consider the case where there is an agent in every vertex. We show that the price of stability is O(log log n). We prove this by defining a ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. We consider the case where there is an agent in every vertex. We show that the price of stability is O(log log n). We prove this by defining
Cost Allocation of Capacity Investment Games
"... Abstract: Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if ..."
Abstract
 Add to MetaCart
operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game
Coherent Allocation of Risk Capital
 Journal of Risk
, 1999
"... The allocation problem stems from the diversification e#ect observed in risk measurements of financial portfolios: the sum of the risk measures of many portfolios is typically larger than the risk of all portfolios taken together. The allocation problem is to apportion this "diversification adv ..."
Abstract

Cited by 86 (0 self)
 Add to MetaCart
from the area of game theory find a direct application, and are used here. Keywords: allocation of risk; coherent risk measure; game theory; Shapley value; AumannShapley prices; RORAC; riskadjusted performance measure. 1 Introduction The underlying theme of this paper is the sharing of costs within
Fair Cost Allocations under Conflicts  A Gametheoretic Point of View
, 2003
"... Optimization theory resolves problems to minimize the total costs when the agents are involved in some conflicts. In this paper, we consider how to allocate the minimized total cost among the agents. To do that, the allocation is required to be fair in a certain sense. We use a gametheoretic point ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Optimization theory resolves problems to minimize the total costs when the agents are involved in some conflicts. In this paper, we consider how to allocate the minimized total cost among the agents. To do that, the allocation is required to be fair in a certain sense. We use a gametheoretic point
Improved Bounds for Facility Location Games with Fair Cost Allocation
, 2009
"... We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connection cost to the chosen node, and shares fairly facility installation cost with other agents having chosen the same location. This ..."
Abstract
 Add to MetaCart
We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connection cost to the chosen node, and shares fairly facility installation cost with other agents having chosen the same location
Results 1  10
of
400