Efficiency Loss in a Network Resource Allocation Game
From MaRDI portal
(Redirected from Publication:5704182)
Recommendations
Cited in
(73)- Almost budget-balanced VCG mechanisms to assign multiple objects
- Profit loss in differentiated oligopolies
- The path player game
- Distributed resource allocation over random networks based on stochastic approximation
- Almost budget balanced mechanisms with scalar bids for allocation of a divisible good
- On the efficiency of all-pay mechanisms
- A network pricing game for selfish traffic
- Equilibrium strategies for multiple interdictors on a common network
- The Price of Anarchy of generic valid utility systems
- Equilibrium existence and uniqueness in network games with additive preferences
- The effect of supplier capacity on the supply chain profit
- Auctioning or assigning an object: some remarkable VCG mechanisms
- A strategic approach to multiple estate division problems
- A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
- Strong equilibria in games with the lexicographical improvement property
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- On the efficiency of equilibria in mean-field oscillator games
- A Stackelberg strategy for routing flow over time
- Generalising diagonal strict concavity property for uniqueness of Nash equilibrium
- Mechanism design for demand management in energy communities
- Efficient advert assignment
- Budgeted personalized incentive approaches for smoothing congestion in resource networks
- The complexity of welfare maximization in congestion games
- The price of anarchy of the proportional allocation mechanism revisited
- Resource allocation games with multiple resource classes
- Public congestion network situations and related games
- On the efficiency of markets with two-sided proportional allocation mechanisms
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- On the efficiency of all-pay mechanisms
- The price of matching with metric preferences
- Pricing with markups in industries with increasing marginal costs
- On the efficiency of price competition
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Conflicting congestion effects in resource allocation games
- Informational Braess' paradox: the effect of information on traffic congestion
- Asymptotic efficiency of the proportional compensation scheme for a large number of producers
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
- Nash social welfare approximation for strategic agents
- Welfare guarantees for proportional allocations
- On the efficiency of the proportional allocation mechanism for divisible resources
- A network pricing game for selfish traffic
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Congestion games with complementarities
- Worst-Case Efficiency Analysis of Queueing Disciplines
- A population game approach for dynamic resource allocation problems
- Nash equilibrium design and price-based coordination in hierarchical systems
- New bounds for the price of anarchy under nonlinear and asymmetric costs
- A game theoretic view of efficiency loss in resource allocation
- Restrictive mechanism of flow control among non-cooperative internet users
- Strategic equilibrium versus global optimum for a pair of competing servers
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Atomic resource sharing in noncooperative networks
- Bounds on the welfare loss from moral hazard with limited liability
- The interaction of economic agents in Cournot duopoly models under ecological conditions: a comparison of organizational modes
- Three modeling paradigms in mathematical programming
- An efficient Nash-implementation mechanism for network resource allocation
- Stability of decentralized queueing networks beyond complete bipartite cases
- scientific article; zbMATH DE number 7726315 (Why is no real title available?)
- Tit-for-tat dynamics and market volatility
- Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly
- Price of stability in survivable network design
- The contest game for crowdsourcing reviews
- 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
- Design of price mechanisms for network resource allocation via price of anarchy
- Centralization in block-building and proposer-builder separation
- The price of anarchy of strategic queuing systems
- Title not available (Why is no real title available?)
- Fragility of the commons under prospect-theoretic risk attitudes
- Incentive-compatible simple mechanisms
- The price of anarchy of serial, average and incremental cost sharing
- Stackelberg contention games in multiuser networks
- An efficient and almost budget balanced cost sharing method
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)
