The following pages link to Nikolai S. Kukushkin (Q423892):
Displaying 50 items.
- Cournot tâtonnement and dominance solvability in finite games (Q423893) (← links)
- Cournot tatonnement and potentials (Q492880) (← links)
- Strong Nash equilibrium in games with common and complementary local utilities (Q502326) (← links)
- Acyclicity of improvements in finite game forms (Q532517) (← links)
- Nash equilibrium in compact-continuous games with a potential (Q548076) (← links)
- Properties of a choice function generated by a binary relation on convex subsets (Q610601) (← links)
- Better response dynamics and Nash equilibrium in discontinuous games (Q684170) (← links)
- Perfect information and potential games (Q700119) (← links)
- Best response dynamics in finite games with additive aggregation (Q705947) (← links)
- Novshek's trick as a polynomial algorithm (Q741711) (← links)
- Corrigendum to: ``Equilibria in ordinal status games'' (Q776966) (← links)
- (Q886436) (redirect page) (← links)
- Maximal elements, fixed points, and quasi-continuous orderings (Q886437) (← links)
- Maximizing an interval order on compact subsets of its domain (Q943582) (← links)
- On the existence of maximal elements: An impossibility theorem (Q943834) (← links)
- Monotonicity-based conditions for the acyclicity of Cournot tatonnement (Q960702) (← links)
- An existence result for coalition-proof equilibrium (Q1127412) (← links)
- On existence of stable and efficient outcomes in games with public and private objectives (Q1185766) (← links)
- (Q1338969) (redirect page) (← links)
- A condition for the existence of a Nash equilibrium in games with public and private objectives (Q1338970) (← links)
- A fixed-point theorem for decreasing mappings (Q1342659) (← links)
- Resource allocation games (Q1343007) (← links)
- Potentials for binary relations and systems of monotone responses. (Q1432309) (← links)
- Fixed point theorems for systems of decreasing functions with additive aggregation (Q1594140) (← links)
- A universal construction generating potential games (Q1651287) (← links)
- Two-person game forms guaranteeing the stability against commitment and delaying tactics (Q1893192) (← links)
- On the existence of optima in complete chains and lattices (Q1937014) (← links)
- Monotone comparative statics: changes in preferences versus changes in the feasible set (Q1950350) (← links)
- Potential games: A purely ordinal approach (Q1960569) (← links)
- Ordinal status games on networks (Q2138379) (← links)
- The single crossing conditions for incomplete preferences (Q2259424) (← links)
- Equilibria in ordinal status games (Q2338665) (← links)
- The structure of utility functions ensuring the existence of an exact potential in a strategic game (Q2358599) (← links)
- Increasing selections from increasing multifunctions (Q2376895) (← links)
- Congestion games revisited (Q2384723) (← links)
- Properties of choice functions generated by a binary relation on compact subsets (Q2455311) (← links)
- On the generic finiteness of equilibrium outcome distributions in bimatrix game forms (Q2475188) (← links)
- Improvement dynamics in games with strategic complementarities (Q2487966) (← links)
- Stable compromises under corrupt arbitration (Q3053948) (← links)
- (Q3206692) (← links)
- (Q3329248) (← links)
- (Q3351307) (← links)
- (Q3478284) (← links)
- On hierarchical three-person games (Q3674433) (← links)
- (Q3718510) (← links)
- Stable compromises in games with lattice payoff functions (Q3745664) (← links)
- (Q3754457) (← links)
- (Q3783109) (← links)
- (Q3793971) (← links)
- (Q3861191) (← links)
