Efficiency Loss in a Network Resource Allocation Game
From MaRDI portal
Publication:5704182
DOI10.1287/MOOR.1040.0091zbMATH Open1082.90015OpenAlexW2167217653MaRDI QIDQ5704182FDOQ5704182
Authors: Ramesh Johari, John N. Tsitsiklis 
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0091
Recommendations
Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (70)
- Tit-for-tat dynamics and market volatility
- Game-theoretic analysis of the interaction of economic agents in the Cournot oligopoly with consideration of the linear structure, the green effect, and fairness concern
- Asymptotic efficiency of the proportional compensation scheme for a large number of producers
- Title not available (Why is that?)
- The interaction of economic agents in Cournot duopoly models under ecological conditions: a comparison of organizational modes
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
- Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly
- On the efficiency of all-pay mechanisms
- The contest game for crowdsourcing reviews
- Distributed resource allocation over random networks based on stochastic approximation
- Strategic equilibrium versus global optimum for a pair of competing servers
- A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
- Pricing with markups in industries with increasing marginal costs
- On the efficiency of markets with two-sided proportional allocation mechanisms
- On the efficiency of price competition
- Stackelberg contention games in multiuser networks
- A population game approach for dynamic resource allocation problems
- Restrictive mechanism of flow control among non-cooperative internet users
- The price of anarchy of the proportional allocation mechanism revisited
- Three modeling paradigms in mathematical programming
- A Stackelberg strategy for routing flow over time
- The price of matching with metric preferences
- Profit loss in differentiated oligopolies
- The effect of supplier capacity on the supply chain profit
- The complexity of welfare maximization in congestion games
- On the efficiency of all-pay mechanisms
- Resource allocation games with multiple resource classes
- On the efficiency of the proportional allocation mechanism for divisible resources
- Stability of decentralized queueing networks beyond complete bipartite cases
- Almost budget-balanced VCG mechanisms to assign multiple objects
- An efficient and almost budget balanced cost sharing method
- The path player game
- Equilibrium strategies for multiple interdictors on a common network
- Design of price mechanisms for network resource allocation via price of anarchy
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Nash equilibrium design and price-based coordination in hierarchical systems
- Fragility of the commons under prospect-theoretic risk attitudes
- An efficient Nash-implementation mechanism for network resource allocation
- Nash social welfare approximation for strategic agents
- The Price of Anarchy of generic valid utility systems
- Auctioning or assigning an object: some remarkable VCG mechanisms
- A Truthful Mechanism for Offline Ad Slot Scheduling
- The price of anarchy of serial, average and incremental cost sharing
- Equilibrium existence and uniqueness in network games with additive preferences
- Atomic resource sharing in noncooperative networks
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Bounds on the welfare loss from moral hazard with limited liability
- On the efficiency of equilibria in mean-field oscillator games
- Mechanism design for demand management in energy communities
- A network pricing game for selfish traffic
- A strategic approach to multiple estate division problems
- Budgeted personalized incentive approaches for smoothing congestion in resource networks
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- A game theoretic view of efficiency loss in resource allocation
- Efficient advert assignment
- Almost budget balanced mechanisms with scalar bids for allocation of a divisible good
- Congestion games with complementarities
- Conflicting congestion effects in resource allocation games
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- Price of stability in survivable network design
- Generalising diagonal strict concavity property for uniqueness of Nash equilibrium
- A network pricing game for selfish traffic
- Public congestion network situations and related games
- Informational Braess' paradox: the effect of information on traffic congestion
- Strong equilibria in games with the lexicographical improvement property
- Welfare guarantees for proportional allocations
- New bounds for the price of anarchy under nonlinear and asymmetric costs
- Worst-Case Efficiency Analysis of Queueing Disciplines
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Incentive-compatible simple mechanisms
This page was built for publication: Efficiency Loss in a Network Resource Allocation Game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704182)
