Results 1  10
of
69,023
Weighted congestion games: Price of anarchy, universal worstcase examples, and tightness
 In Proceedings of the 18th Annual European Symposium on Algorithms (ESA
, 2010
"... Abstract. We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (co ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
(cost functionindependent) worstcase examples. One noteworthy byproduct of our proofs is the fact that weighted congestion games are “tight”, which implies that the worstcase price of anarchy with respect to pure Nash, mixed Nash, correlated, and coarse correlated equilibria are always equal (under
XWeighted Congestion Games: The Price of Anarchy, Universal WorstCase Examples, and Tightness
"... We characterize the price of anarchy (POA) in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost ..."
Abstract
 Add to MetaCart
functionindependent) worstcase examples. One noteworthy byproduct of our proofs is the fact that weighted congestion games are “tight, ” which implies that the worstcase price of anarchy with respect to pure Nash equilibria, mixed Nash equilibria, correlated equilibria, and coarse correlated equilibria
A WorstCase Example Using Linesearch Methods for Numerical Optimization with Inexact Gradient Evaluations.
, 1991
"... Two approaches often used to improve the robustness of numerical optimization algorithms are linesearch and trust region methods. Trust region methods have previously been shown to be extremely forgiving of high levels of noise and inaccuracy in gradient evaluations. We present a worstcase example ..."
Abstract
 Add to MetaCart
Two approaches often used to improve the robustness of numerical optimization algorithms are linesearch and trust region methods. Trust region methods have previously been shown to be extremely forgiving of high levels of noise and inaccuracy in gradient evaluations. We present a worstcase example
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 847 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2006
"... We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semisupervised framework that incorporates labeled and unlabeled data in a generalpurpose learner. Some transductive graph learning al ..."
Abstract

Cited by 578 (16 self)
 Add to MetaCart
algorithms and standard methods including Support Vector Machines and Regularized Least Squares can be obtained as special cases. We utilize properties of Reproducing Kernel Hilbert spaces to prove new Representer theorems that provide theoretical basis for the algorithms. As a result (in contrast to purely
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
combined with Leaky Bucket admission control, allows the network to make a wide range of worstcase performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees, and is efficient in that each of the servers is work
Casebased reasoning; Foundational issues, methodological variations, and system approaches
 AI COMMUNICATIONS
, 1994
"... Casebased reasoning is a recent approach to problem solving and learning that has got a lot of attention over the last few years. Originating in the US, the basic idea and underlying theories have spread to other continents, and we are now within a period of highly active research in casebased rea ..."
Abstract

Cited by 855 (25 self)
 Add to MetaCart
in the light of a few example systems that represent different CBR approaches. We also discuss the role of casebased methods as one type of reasoning and learning method within an integrated system architecture.
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 717 (4 self)
 Add to MetaCart
must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (“Fagin’s Algorithm”, or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
Transform Analysis and Asset Pricing for Affine JumpDiffusions
 Econometrica
, 2000
"... In the setting of ‘‘affine’ ’ jumpdiffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example applicat ..."
Abstract

Cited by 710 (38 self)
 Add to MetaCart
In the setting of ‘‘affine’ ’ jumpdiffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example
Results 1  10
of
69,023