Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pareto equilibria for bimatrix games

From MaRDI portal
Publication:1802491
Jump to:navigation, search

DOI10.1016/0898-1221(93)90277-3zbMath0778.90088OpenAlexW2123104788MaRDI QIDQ1802491

P. E. M. Borm, S. H. Tijs, M. J. M. Jansen, Jos A. M. Potters

Publication date: 21 July 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/4c66db1e-0888-4798-aacf-add0a26699c9


zbMATH Keywords

Pareto equilibriabimatrix gamemaximal Nash subsetsproper and persistent equilibria


Mathematics Subject Classification ID

2-person games (91A05)


Related Items

A note on determining pure-strategy equilibrium points of bimatrix games ⋮ On the set of proper equilibria of a bimatrix game



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • On the set of proper equilibria of a bimatrix game
  • Persistent equilibria in strategic games
  • On stability of perfect equilibrium points
  • Reexamination of the perfectness concept for equilibrium points in extensive games
  • On strictly perfect sets
  • On the structure of the set of perfect equilibria in bimatrix games
  • Non-cooperative games
  • Maximal nash subsets for bimatrix games
  • On nash subsets and mobility chains in bimatrix games
  • AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
  • Refinements of the Nash equilibrium concept
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1802491&oldid=14161812"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki