Results 1  10
of
232
A Power Allocation Game in a Four Node Relay Network: An Upper Bound on the WorstCase Equilibrium Efficiency
, 2008
"... We introduce a power allocation game in a four node relay network which consists of two source and two destination nodes. The sources employ a time sharing protocol such that in each discrete time instance one of the sources communicates with its destination while the other source aids this communic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to use all of its power for its own use, i.e., no relaying. This results in an inferior sum rate with respect to the optimum sum rate jointly maximized over all possible power allocations. The main contribution of this paper is to establish an upper bound on the worstcase equilibrium efficiency (a
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
Which is the worstcase Nash equilibrium?
 IN PROCEEDINGS OF THE 26TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS
, 2003
"... A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such equilibria within the context of a certain game that models selfish routing for a ..."
Abstract

Cited by 22 (13 self)
 Add to MetaCart
for a set of n users each shipping its traffic over a network consisting of m parallel links. In particular, we are interested in identifying the worstcase Nash equilibrium – the one that maximizes social cost. Worstcase Nash equilibria were first introduced and studied in the pioneering work
On the Structure and Complexity of Worstcase Equilibria
 In Proceedings of the 1st Workshop on Internet and Network Economics (WINE 2005
, 2005
"... Abstract. We study an intensively studied resource allocation game introduced by Koutsoupias and Papadimitriou where n weighted jobs are allocated to m identical machines. It was conjectured by Gairing et al. that the fully mixed Nash equilibrium is the worst Nash equilibrium for this game w. r. t. ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
factors. In addition, we present an algorithm that constructs socalled concentrated equilibria that approximate the worstcase Nash equilibrium within constant factors. 1 Introduction A central problem arising in the management of largescale communication networks like the Internet is that of routing
Worstcase Analysis of NonCooperative Load Balancing
, 2012
"... We investigate the impact of heterogeneity in the amount of incoming traffic routed by dispatchers in a noncooperative load balancing game. For a fixed amount of total incoming traffic, we give sufficient conditions on the cost function under which the worstcase social cost occurs when each dispat ..."
Abstract
 Add to MetaCart
We investigate the impact of heterogeneity in the amount of incoming traffic routed by dispatchers in a noncooperative load balancing game. For a fixed amount of total incoming traffic, we give sufficient conditions on the cost function under which the worstcase social cost occurs when each
Worstcase and Nash Routing Policies in Parallel Queues with Uncertain Service Allocations
 University of Minnesota
, 1993
"... We consider two dynamic routing problems into several parallel queues. First, we consider the case where the total service rate in all queues is constant, but its distribution between the queues may vary. Arriving customers are routed by a controller, with the purpose of minimizing the total discoun ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
discounted holding cost under worstcase service conditions. A zerosum game analysis yields that the optimal strategy for the router is `join the shortest queue', while the worst service strategy is `serve the shortest queue'. The second problem considered is individually optimal routing in a
The worstcase interference in DSL systems employing dynamic spectrum management
 Eurasip Journal on Applied Signal Processing
"... Dynamic Spectrum Management (DSM) has been proposed to achieve nextgeneration rates on digital subscriber lines (DSL). Because the copper twistedpair plant is an interferenceconstrained environment, the multiuser performance and spectral compatibility of DSM schemes are of primary concern. While ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
modem that is tight in the presence of the worstcase interference. A gametheoretic analysis shows that the ratemaximizing strategy under the worstcase interference (WCI) in the DSM setting corresponds to a Nash equilibrium in pure strategies of a certain strictly competitive game. A Nash equilibrium
The WorstCase Efficiency of Cost Sharing Methods in Resource Allocation Games
"... Resource allocation problems play a key role in many applications, including traffic networks, telecommunication networks, and economics. In most applications, the allocation of resources is determined by a finite number of independent players, each optimizing an individual objective function. An i ..."
Abstract
 Add to MetaCart
. An important question in all these applications is the degree of suboptimality caused by selfish resource allocation. We consider the worstcase efficiency of cost sharing methods in resource allocation games in terms of the ratio of the minimum guaranteed surplus of a Nash equilibrium and the maximal surplus
Price of Airline Frequency Competition
, 2010
"... Frequency competition influences capacity allocation decisions in airline markets and has important implications to airline profitability and airport congestion. Market share of a competing airline is a function of its frequency share and the relationship between the two is pivotal for understanding ..."
Abstract
 Add to MetaCart
analyze two different myopic learning dynamics for the nonequilibrium situations and prove their convergence to Nash equilibrium under mild conditions. For the Nplayer game between identical players, we characterize all the pure strategy equilibria and identify the worstcase equilibrium, i
Disclosure and Choice1
, 2014
"... An agent chooses among projects with random outcomes. His payoff is increasing in the outcome and in an observer’s expectation of the outcome. With some probability, the agent can disclose the true outcome to the observer. We show that choice is inefficient: the agent favors riskier projects even wi ..."
Results 1  10
of
232