( en | de | ru )

 

Disambiguation of "Goldberg, Paul W."

Author of the publication

copydeleteadd this publication to your clipboard
The Price of Selfish Stackelberg Leadership in a Network Game

, and . CoRR, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Goldberg

Paul W Bruno

Max Goldberg

Walter Goldberg

Katja Goldberg

 

Other publications of authors with the same name

Using lotteries to approximate the optimal revenue., and . AAMAS, page 643-650. IFAAMAS, (2013)Query Complexity of Approximate Equilibria in Anonymous Games., and . WINE, volume 9470 of Lecture Notes in Computer Science, page 357-369. Springer, (2015)On the communication complexity of approximate Nash equilibria., and . Games Econ. Behav., (2014)Learning Fixed-Dimension Linear Thresholds from Fragmented Data.. COLT, page 88-99. ACM, (1999)Computing good nash equilibria in graphical games., , and . EC, page 162-171. ACM, (2007)Revenue Maximization for Market Intermediation with Correlated Priors., , and . SAGT, volume 9928 of Lecture Notes in Computer Science, page 273-285. Springer, (2016)Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required.. COLT/EuroCOLT, volume 2111 of Lecture Notes in Computer Science, page 116-127. Springer, (2001)Lower bounds for the query complexity of equilibria in Lipschitz games., and . Theor. Comput. Sci., (June 2023)Ranking games that have competitiveness-based strategies., , , and . Theor. Comput. Sci., (2013)The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard., and . Electron. Colloquium Comput. Complex., (2018)