Pages that link to "Item:Q2560099"
From MaRDI portal
The following pages link to A class of games possessing pure-strategy Nash equilibria (Q2560099):
Displayed 50 items.
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- Primary versus secondary infrastructure capacity allocation mechanisms (Q2158023) (← links)
- Sensitivity of wardrop equilibria: revisited (Q2174917) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- Ordinal potentials in smooth games (Q2218540) (← links)
- With potential games, which outcome is better? (Q2221288) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Games and cost of change (Q2241245) (← links)
- Nash-stable coalition partition and potential functions in games with coalition structure (Q2242407) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Taxed congestion games with failures (Q2268914) (← links)
- Iterated potential and robustness of equilibria (Q2271379) (← links)
- A testable model of consumption with externalities (Q2271382) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game (Q2287675) (← links)
- Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms (Q2288975) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
- Potential functions for finding stable coalition structures (Q2294362) (← links)
- Pathwise smooth splittable congestion games and inefficiency (Q2304200) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- On the stability of an adaptive learning dynamics in traffic games (Q2319665) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Heterogeneity and chaos in congestion games (Q2335582) (← links)
- Nonspecific networking (Q2344966) (← links)
- Self-organizing flows in social networks (Q2345453) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Equilibrium routing under uncertainty (Q2349119) (← links)
- The structure of utility functions ensuring the existence of an exact potential in a strategic game (Q2358599) (← links)
- A survey of static and dynamic potential games (Q2360803) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- The cutting power of preparation (Q2379185) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Congestion games revisited (Q2384723) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)