Pages that link to "Item:Q5247620"
From MaRDI portal
The following pages link to Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620):
Displayed 19 items.
- Dynamic potential games: the discrete-time stochastic case (Q483902) (← links)
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- Topological price of anarchy bounds for clustering games on networks (Q777968) (← links)
- Potential differential games (Q1649017) (← links)
- Shapley value-based payment calculation for energy exchange between micro- and utility grids (Q1656982) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- Weighted and near weighted potential games with application to game theoretic control (Q2139421) (← links)
- Cost-sharing strategy for carbon emission reduction and sales effort: a Nash game with government subsidy (Q2190326) (← links)
- A survey of static and dynamic potential games (Q2360803) (← links)
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Q2947026) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- Value of Information in Bayesian Routing Games (Q4994147) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
- Cost-Sharing in Generalised Selfish Routing (Q5283373) (← links)
- The Buck-Passing Game (Q5868932) (← links)
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games (Q5870354) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)