Pages that link to "Item:Q5172746"
From MaRDI portal
The following pages link to Intrinsic robustness of the price of anarchy (Q5172746):
Displaying 50 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers (Q291314) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Competitive routing over time (Q719282) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- The price of anarchy and stability in general noisy best-response dynamics (Q1621728) (← links)
- Bifurcation mechanism design -- from optimal flat taxes to better cancer treatments (Q1651898) (← links)
- Evolutionary game theory: a renaissance (Q1651914) (← links)
- Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games (Q1709974) (← links)
- How good is a two-party election game? (Q2031050) (← links)
- Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
- FIFO and randomized competitive packet routing games (Q2085747) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Heterogeneity and chaos in congestion games (Q2335582) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Coarse correlated equilibria in linear duopoly games (Q2376064) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- On a generalized Cournot oligopolistic competition game (Q2393078) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- Improving Nash by coarse correlation (Q2439924) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Robust equilibria in location games (Q2629657) (← links)
- The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games (Q2819453) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- Incentives and Efficiency in Uncertain Collaborative Environments (Q2937744) (← links)
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions (Q2937761) (← links)
- Efficient Equilibria in Polymatrix Coordination Games (Q2946422) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Correlated and Coarse Equilibria of Single-Item Auctions (Q2959824) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- On Learning Algorithms for Nash Equilibria (Q3162512) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games (Q3449591) (← links)
- Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information (Q4607282) (← links)
- Price of anarchy for Mean Field Games (Q4967881) (← links)
- Price of Anarchy for Mechanisms with Risk-Averse Agents (Q5002845) (← links)
- Wealth Inequality and the Price of Anarchy (Q5090481) (← links)
- (Q5111732) (← links)
- Cost-Sharing in Generalised Selfish Routing (Q5283373) (← links)
- Bottleneck links, variable demand, and the tragedy of the commons (Q5326768) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games (Q5891841) (← links)
- Tight bounds for the price of anarchy and stability in sequential transportation games (Q6053961) (← links)
