On the communication complexity of approximate Nash equilibria (Q2442839): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
On the Communication Complexity of Approximate Nash Equilibria
description / endescription / en
scientific article
scientific article; zbMATH DE number 6144479
Property / title
 
On the Communication Complexity of Approximate Nash Equilibria (English)
Property / title: On the Communication Complexity of Approximate Nash Equilibria (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1284.91021 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-33996-7_17 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithmic Game Theory / rank
 
Normal rank
Property / publication date
 
13 March 2013
Timestamp+2013-03-13T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 13 March 2013 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6144479 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059732663 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1759912955 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1302.3793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: On Learning Algorithms for Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate well-supported Nash equilibria below two-thirds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrated learning and correlated equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation performance of fictitious play in finite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: How long to equilibrium? The communication complexity of uncoupled equilibrium procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Adaptive Procedure Leading to Correlated Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic uncoupled dynamics and Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well supported approximate equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank

Latest revision as of 12:38, 7 July 2024

scientific article; zbMATH DE number 6144479
  • On the Communication Complexity of Approximate Nash Equilibria
Language Label Description Also known as
English
On the communication complexity of approximate Nash equilibria
scientific article; zbMATH DE number 6144479
  • On the Communication Complexity of Approximate Nash Equilibria

Statements

On the communication complexity of approximate Nash equilibria (English)
0 references
On the Communication Complexity of Approximate Nash Equilibria (English)
0 references
0 references
0 references
1 April 2014
0 references
13 March 2013
0 references
two player
0 references
mixed strategy
0 references
approximate equilibria
0 references
efficient algorithms
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references