Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,189
The Uniform Allocation Rule and the Nucleolus M. Angeles de Frutos Boston University
, 1995
"... We show the relationship between the Uniform Allocation Rule for solving the division problem with single-peaked preferences studied by Sprumont (1991) and the Nucleolus of its associated cooperative game a la Aumann and Maschler. Financial support by the Instituto de Estudios Fiscales and by the DG ..."
Abstract
- Add to MetaCart
We show the relationship between the Uniform Allocation Rule for solving the division problem with single-peaked preferences studied by Sprumont (1991) and the Nucleolus of its associated cooperative game a la Aumann and Maschler. Financial support by the Instituto de Estudios Fiscales
Finite-time analysis of the multiarmed bandit problem
- Machine Learning
, 2002
"... Abstract. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy’s success in addressing ..."
Abstract
-
Cited by 817 (15 self)
- Add to MetaCart
to grow at least logarithmically in the number of plays. Since then, policies which asymptotically achieve this regret have been devised by Lai and Robbins and many others. In this work we show that the optimal logarithmic regret is also achievable uniformly over time, with simple and efficient policies
Matchmaking: Distributed Resource Management for High Throughput Computing
- In Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing
, 1998
"... Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not adapt well to distributed systems, particularly those built to support high-throughput computing. Obstacles include heteroge ..."
Abstract
-
Cited by 435 (20 self)
- Add to MetaCart
heterogeneity of resources, which make uniform allocation algorithms difficult to formulate, and distributed ownership, leading to widely varying allocation policies. Faced with these problems, we developed and implemented the classified advertisement (classad) matchmaking framework, a flexible and general
Balanced Allocations
- SIAM Journal on Computing
, 1994
"... Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1)) ln n/ ln ln n balls in it. Suppose instead that for each ball we choose two boxes at random and place ..."
Abstract
-
Cited by 326 (8 self)
- Add to MetaCart
uniformly at random, is deleted, and one ball is added in the manner above. We discuss consequences of this and related theorems for dynamic resource allocation, hashing, and on-line load balancing.
VL2: Scalable and Flexible Data Center Network”,
- ACM SIGCOMM Computer Communication Review,
, 2009
"... Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales t ..."
Abstract
-
Cited by 461 (12 self)
- Add to MetaCart
Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales
The UAR: Equality and Consistency W.P. 288.95 More on the Uniform Allocation Rule: Equality and Consistency M. Angeles de Frutos¤
, 1995
"... We study the distributive and consistency properties of the Uniform Alloca-tion Rule for solving the division problem with single-peaked preferences studied by Sprumont (1991). We show that under e±ciency, strategy-proofness and anonymity can be replaced by Lorenz dominance. We also characterize the ..."
Abstract
- Add to MetaCart
We study the distributive and consistency properties of the Uniform Alloca-tion Rule for solving the division problem with single-peaked preferences studied by Sprumont (1991). We show that under e±ciency, strategy-proofness and anonymity can be replaced by Lorenz dominance. We also characterize
A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation
"... The realization of end-to-end quality of service (QoS) guarantees in emerging network-based applications requires mechanisms that support first dynamic discovery and then advance or immediate reservation of resources that will often be heterogeneous in type and implementation and independently contr ..."
Abstract
-
Cited by 245 (26 self)
- Add to MetaCart
controlled and administered.We propose the Globus Architecture for Reservation and Allocation (GARA) to address these four issues.GARA treats both reservations and computational elements such as processes, network flows, and memory blocks as first class entities, allowing them to be created, monitored
A Proportional Share Resource Allocation Algorithm For Real-Time, Time-Shared Systems
, 1996
"... We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. In a proportional share system, processes are assigned a weight which determines a share (percentage) of the resource they are to receive. The resource is t ..."
Abstract
-
Cited by 215 (17 self)
- Add to MetaCart
is then allocated in discrete-sized time quanta in such a manner that each process makes progress at a precise, uniform rate. Proportional share allocation algorithms are of interest because (1) they provide a natural means of seamlessly integrating real- and non-real-time processing requirements in a general
On Competitiveness in Uniform Utility Allocation Markets
"... In this paper, we study competitive markets- a market is competitive if increasing the endowment of any one buyer does not increase the equilibrium utility of any other buyer. In the Fisher setting, competitive markets contain all markets with weak gross substitutability (WGS), a property which enab ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
enable efficient algorithms for equilibrium computation. We show that every uniform utility allocation (UUA) market which is competitive, is a submodular utility allocation (SUA) market. Our result provides evidence for the existence of efficient algoritheorems for the class of competitive markets.
Preference manipulations lead to the uniform rule
, 2007
"... In the division problem with single-peaked preferences, it is well known that the uniform rule is robust to strategic manipulation. Furthermore, under e ¢ ciency and symmetry, it is the unique strategy-proof rule (Sprumont, 1991; Ching, 1994). We conversely analyze the consequences of strategic mani ..."
Abstract
- Add to MetaCart
allocation and it is the uniform allocation. Furthermore, it is also the unique Pareto-e ¢ cient Nash equilibrium allocation. Under an additional strict monotonicity condition, we show that the uniform allocation is the unique Nash equilibrium allocation. These results underline how strong the position
Results 1 - 10
of
1,189
