Approximate Nash equilibria in anonymous games (Q2253838): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jet.2014.02.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083207585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of an Equilibrium for a Competitive Economy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous games with binary actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The women of Cairo: equilibria in large anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence to approximate Nash equilibria in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient PTAS for Two-Strategy Anonymous Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365135 / 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: The Complexity of Computing a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Nash equilibria in anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On oblivious PTAS's for nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse covers for sums of indicators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative <i>N</i> Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Equilibria in Markets with Non-Convex Preferences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:20, 9 July 2024

scientific article
Language Label Description Also known as
English
Approximate Nash equilibria in anonymous games
scientific article

    Statements

    Approximate Nash equilibria in anonymous games (English)
    0 references
    13 February 2015
    0 references
    0 references
    anonymous games
    0 references
    Nash equilibrium
    0 references
    approximation algorithms
    0 references
    0 references