Pages that link to "Item:Q980970"
From MaRDI portal
The following pages link to Leadership games with convex strategy sets (Q980970):
Displaying 20 items.
- Endogenous timing in a mixed duopoly (Q403978) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players (Q969506) (← links)
- Buying optimal payoffs in bi-matrix games (Q1630445) (← links)
- Commitment in first-price auctions (Q1798804) (← links)
- Two-person game forms guaranteeing the stability against commitment and delaying tactics (Q1893192) (← links)
- Perfect information games where each player acts only once (Q1996105) (← links)
- Learning Machiavellian strategies for manipulation in Stackelberg security games (Q2122770) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- A sequential Stackelberg game for dynamic inspection problems (Q2672097) (← links)
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
- Computing Equilibria with Partial Commitment (Q2959814) (← links)
- Recursive Inspection Games (Q3186537) (← links)
- (Q4025250) (← links)
- On the Commitment Value and Commitment Optimal Strategies in Bimatrix Games (Q4961342) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
