Richard Weber

Q: What Schools Are Affiliated With Richard Weber

Richard Weber is affiliated with the following schools: Imperial College London, University of Oxford, University of Cambridge

Richard Weber 's AcademicInfluence.com Rankings

Richard Weber

Mathematics

#2786

World Rank

#4228

Historical Rank

Measure Theory

#2853

World Rank

#3394

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Richard Weber 's Degrees

PhD Mathematics University of Oxford

Why Is Richard Weber Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Robert Weber is a mathematician working in operational research. He is Emeritus Churchill Professor of Mathematics for Operational Research in the Statistical Laboratory, University of Cambridge.

(See a Problem?)

Richard Weber 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On an index policy for restless bandits (1990) (456)
Multi-Armed Bandit Allocation Indices: Gittins/Multi-Armed Bandit Allocation Indices (2011) (348)
Pricing Communication Networks (2003) (326)
Pricing communication networks - economics, technology and modelling (2003) (324)
On the optimal assignment of customers to parallel servers (1978) (305)
On the Gittins Index for Multiarmed Bandits (1992) (277)
Optimal control of service rates in networks of queues (1987) (274)
A survey of Markov decision models for control of networks of queues (1993) (224)
Buffer overflow asymptotics for a buffer handling many traffic sources (1996) (140)
Optimal Robot Scheduling for Web Search Engines (1998) (140)
The rendezvous problem on discrete locations (1990) (134)
Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs (1989) (122)
Optimal scheduling of peer-to-peer file dissemination (2006) (110)
Admission control and routing in ATM networks using inferences from measured buffer occupancy (1995) (110)
Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime (1982) (107)
Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime (1986) (100)
A study of simple usage‐based charging schemes for broadband networks (1998) (98)
Measurement-Based Usage Charges in Comminucations Networks (2000) (92)
Effective Bandwidths for Stationary Sources (1995) (80)
Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization) (2003) (70)
Incentives for large peer-to-peer systems (2006) (61)
The interchangeability of ·/M/1 queues in series (1979) (58)
On the Sum-of-Squares algorithm for bin packing (2002) (57)
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (2000) (47)
Addendum to ‘On an index policy for restless bandits' (1991) (47)
Markov chains, computer proofs, and average-case analysis of best fit bin packing (1993) (46)
Technical Note - A Note on Waiting Times in Single Server Queues (1983) (43)
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study (1991) (43)
Optimal selection of stochastic intervals under a sum constraint (1987) (42)
Minimizing expected makespans on uniform processor systems (1987) (42)
Analysis of peer-to-peer file dissemination amongst users of different upload capacities (2006) (41)
Note-On the Marginal Benefit of Adding Servers to G/GI/m Queues (1980) (41)
A Self Organizing Bin Packing Heuristic (1999) (39)
E-cient File Dissemination using Peer-to-Peer Technology (2005) (37)
A more general Pandora rule? (2015) (34)
On the Performance of an Effective Bandwidths Formula (1994) (30)
Analysis of peer-to-peer file dissemination (2006) (29)
Bin packing with discrete item sizes, part II: Tight bounds on First Fit (1997) (29)
A counterexample to a conjecture on optimal list ordering (1982) (28)
On the optimality of LEPT and cµ rules for machines in parallel (1992) (28)
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (2002) (28)
SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS (1982) (24)
On the sum-of-squares algorithm for bin packing (2000) (23)
On a conjecture about assigning jobs to processors of differing speeds (1993) (23)
Economic Issues in Shared Infrastructures (2009) (22)
Dominant Strategies in Stochastic Allocation and Scheduling Problems (1982) (21)
Indexability and whittle index for restless bandit problems involving reset processes (2011) (21)
Optimal Symmetric Rendezvous Search on Three Locations (2012) (19)
An Asymptotically Optimal Scheme for P2P File Sharing (2004) (18)
Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints (1990) (17)
Necessary and sufficient conditions for stability of a bin-packing system (1986) (17)
Comments on: Dynamic priority allocation via restless bandit marginal productivity indices (2007) (15)
Asymptotics for Provisioning Problems of Peering Wireless LANs with a Large Number of Participants (2004) (15)
Optimal search for a randomly moving object (1986) (14)
The interchangeability of tandem queues with heterogeneous customers and dependent service times (1992) (14)
Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime (1982) (12)
INEQUALITIES AND BOUNDS IN STOCHASTIC SHOP SCHEDULING (1984) (12)
Stochastic Scheduling on Parallel Processors and Minimization of Concave Functions of Completion Times (1988) (10)
The Cafeteria Process - Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon (1994) (10)
Pricing and Communications Networks (2003) (10)
An Optimal Strategy in Multi-server Stochastic Scheduling (1978) (9)
Stabilizing an uncertain production system (1989) (9)
The optimal strategy for symmetric rendezvous search on K3 (2009) (9)
A bin-packing system for objects with sizes from a finite set: Necessary and sufficient conditions for stability and some applications (1986) (8)
Optimal Pricing for Peer-to-Peer Sharing With Network Externalities (2018) (8)
Cost‐Based Pricing (2003) (8)
Concavity and monotonicity properties in a groundwater management model (2011) (8)
Economic issues in shared infrastructures (2012) (8)
Special article [paid peering: pricing and adoption incentives] (2016) (8)
Revenue Models, Price Differentiation and Network Neutrality Implications in the Internet (2014) (8)
Stability of Flexible Manufacturing Systems (1994) (7)
Stochastic dispatching of multi-priority jobs to heterogeneous processors (1990) (7)
Pricing Resources on Demand (2006) (7)
ABCs of the bomber problem and its relatives (2013) (6)
Multiarmed Bandits and Gittins Index (2011) (6)
Pricing the fast-lanes: A qualitative study on the implications of paid peering agreements (2016) (5)
Introduction or Exploration (2011) (5)
The Move-to-Front Rule for Multiple Lists (1990) (4)
Monotone Optimal Policies for Left-Skip-Free Markov Decision Processes (1999) (4)
Investigation of Cell Scale and Burst Scale Effects on the Cell Loss Probability using Large Deviati (1997) (4)
Asymptotics for Provisioning Problems with a Large Number of Participants (2003) (4)
SEQUENTIAL OPEN-LOOP SCHEDULING STRATEGIES (1982) (3)
The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4 (2009) (3)
A more general Pandora's rule? (2015) (3)
Efficient Content Distribution Using Peer-to-Peer Technology (2006) (3)
Dynamic Bandwidth Pricing: Provision Cost, Market Size, Effective Bandwidths and Price Games (2008) (2)
Optimal pricing for a peer-to-peer sharing platform under network externalities (2018) (2)
Optimal call routing in VoIP (2009) (2)
Strategy for Quickest Second Meeting of Two Agents in Two Locations (2012) (2)
Low-Complexity Algorithm for Restless Bandits with Imperfect Observations (2021) (1)
Frank Ramsey: A Sheer Excess of Powers (2021) (1)
Feature article [Paid peering: pricing and adoption incentives] (2016) (1)
Multi‐Population Random Sampling (Theory) (2011) (1)
BUFFER OVERFLOW ASYMPTOTICS FOR A BUFFERHANDLING MANY TRAFFIC (1995) (1)
Appendix A: Lagrangian Methods for Constrained Optimization (2003) (0)
Main Ideas: Gittins Index (2011) (0)
Charging Guaranteed Services (2003) (0)
Necessary Assumptions for Indices (2011) (0)
Adaptive control of admissions and routing in an ATM network (1992) (0)
Cell Scale and Burst Scale E ects : An Asymptotic Approach for Calculating Cell (2007) (0)
Chilean Institute of Operations Research (2010) (0)
Multi‐Population Random Sampling (Calculations) (2011) (0)
Appendix B: Convergence of Tatonnement (2003) (0)
The Achievable Region Methodology (2011) (0)
Sharing Resources and Costs in Computational Grids (2009) (0)
Myths and Counterexamples in Special Forms of Mathematical Programming (2010) (0)
MONOTONE STRUCTURE IN DISCRETE‐EVENT SYSTEMS (Probability and Mathematical Statistics) (1996) (0)
ORTHOGONALITY RELATIONS OF MANY TIME GENERATING FUNCTIONALS OF HARMONIC OSCILLATORS. (1971) (0)
Restless Bandits and Lagrangian Relaxation (2011) (0)
Network Constraints and Effective Bandwidths (2003) (0)
Superprocesses, Precedence Constraints and Arrivals (2011) (0)
Charging Flexible Contracts (2003) (0)
A Self-Organizing Bin Packing HeuristicJanos Csirik (1999) (0)
Mathematics for Operations Research (2003) (0)
OPTIMAL LIST ORDERING (1982) (0)
Network Services and Contracts (2003) (0)
On the Stability Proof of Adaptive Schemes with Static Normalizing Signals and Parameter Projection (1993) (0)
CHAPTER 13 MONOTONE OPTIMAL POLICIES FOR LEFT-SKIP-FREE MARKOV DECISION PROCESSES (2011) (0)

This paper list is powered by the following services:

Other Resources About Richard Weber

What Schools Are Affiliated With Richard Weber ?

Richard Weber is affiliated with the following schools:

Richard Weber 's Academic­Influence.com Rankings