Approximate Nash Equilibria for Multi-player Games (Q5459991): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1513282132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for approximate Nash equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank

Latest revision as of 22:34, 27 June 2024

scientific article; zbMATH DE number 5270417
Language Label Description Also known as
English
Approximate Nash Equilibria for Multi-player Games
scientific article; zbMATH DE number 5270417

    Statements