Paul W. Goldberg

184 papers A* 31A 6B 20C 2Journal 112Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Computing Equilibrium Points of Electrostatic Potentials. ITCS Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender
2026	J	`jnl`	Decentralized Trading Networks: Equilibria and Fairness. CoRR Simon Finster, Paul W. Goldberg, Edwin Lock, Matilde Tullii
2026	J	`jnl`	The Computational Intractability of Not Worst Responding. CoRR Mete Seref Ahunbay, Paul W. Goldberg, Edwin Lock, Panayotis Mertikopoulos, Bary S. R. Pradelski, Bassel Tarbush
2025	J	`jnl`	Complexity of Unambiguous Problems in Σ CoRR Matan Gilboa, Paul W. Goldberg, Elias Koutsoupias, Noam Nisan
2025	J	`jnl`	Computing Equilibrium Points of Electrostatic Potentials. CoRR Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender
2025	J	`jnl`	Contest design with threshold objectives. Int. J. Game Theory Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2025	A*	`conf`	Decentralized Convergence to Equilibrium Prices in Trading Networks. AAAI Edwin Lock, Benjamin Patrick Evans, Eleonora Kreacic, Sujay Bhatt, Alec Koppel, Sumitra Ganesh, Paul W. Goldberg
2025	J	`jnl`	The Complexity of Computing KKT Solutions of Quadratic Programs. J. ACM John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2025	J	`jnl`	The frontier of intractability for EFX with two agents. Theor. Comput. Sci. Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2024	J	`jnl`	Continuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs. CoRR Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2024	J	`jnl`	Decentralized Convergence to Equilibrium Prices in Trading Networks. CoRR Edwin Lock, Benjamin Patrick Evans, Eleonora Kreacic, Sujay Bhatt, Alec Koppel, Sumitra Ganesh, Paul W. Goldberg
2024	J	`jnl`	Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. CoRR Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul W. Goldberg, Vincent Conitzer
2024	J	`jnl`	Solving Strong-Substitutes Product-Mix Auctions. Math. Oper. Res. Elizabeth Baldwin, Paul W. Goldberg, Paul Klemperer, Edwin Lock
2024	A*	`conf`	The Complexity of Computing KKT Solutions of Quadratic Programs. STOC John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2023	A*	`conf`	Best-Response Dynamics in Lottery Contests. EC Abheek Ghosh, Paul W. Goldberg
2023	J	`jnl`	Best-Response Dynamics in Lottery Contests. CoRR Abheek Ghosh, Paul W. Goldberg
2023	J	`jnl`	Lower bounds for the query complexity of equilibria in Lipschitz games. Theor. Comput. Sci. Paul W. Goldberg, Matthew J. Katzman
2023	J	`jnl`	PPAD-complete approximate pure Nash equilibria in Lipschitz games. Theor. Comput. Sci. Paul W. Goldberg, Matthew J. Katzman
2023	J	`jnl`	Substitutes markets with budget constraints: solving for competitive and optimal prices. CoRR Simon Finster, Paul W. Goldberg, Edwin Lock
2023	J	`jnl`	The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2023	A*	`conf`	The Computational Complexity of Single-Player Imperfect-Recall Games. IJCAI Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer, Paul W. Goldberg
2023	J	`jnl`	The Computational Complexity of Single-Player Imperfect-Recall Games. CoRR Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer, Paul W. Goldberg
2023	B	`conf`	The Frontier of Intractability for EFX with Two Agents. SAGT Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2023	J	`jnl`	The Frontier of Intractability for EFX with Two Agents. CoRR Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2022	J	`jnl`	Consensus Division in an Arbitrary Ratio. CoRR Paul W. Goldberg, Jiawei Li
2022	J	`jnl`	Consensus Halving for Sets of Items. Math. Oper. Res. Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2022	A*	`conf`	Contests to Incentivize a Target Group. IJCAI Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2022	J	`jnl`	Learning Strong Substitutes Demand via Queries. ACM Trans. Economics and Comput. Edwin Lock, Paul W. Goldberg, Francisco J. Marmolejo Cossío
2022	B	`conf`	PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games. SAGT Paul W. Goldberg, Matthew J. Katzman
2022	J	`jnl`	PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games. CoRR Paul W. Goldberg, Matthew J. Katzman
2022	B	`conf`	Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. SAGT Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2022	J	`jnl`	Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. CoRR Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2021	—	`conf`	Contest Design with Threshold Objectives. WINE Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2021	J	`jnl`	Contest Design with Threshold Objectives. CoRR Edith Elkind, Abheek Ghosh, Paul W. Goldberg
2021	J	`jnl`	Equivalence of Models of Cake-Cutting Protocols. CoRR Paul W. Goldberg, Ioana Iaru
2021	J	`jnl`	Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries. ACM Trans. Economics and Comput. Paul W. Goldberg, Francisco J. Marmolejo Cossío
2021	B	`conf`	Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games. SAGT Paul W. Goldberg, Matthew J. Katzman
2021	J	`jnl`	Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games. CoRR Paul W. Goldberg, Matthew J. Katzman
2021	J	`jnl`	The Hairy Ball problem is PPAD-complete. J. Comput. Syst. Sci. Paul W. Goldberg, Alexandros Hollender
2021	A*	`conf`	The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2020	J	`jnl`	Approximately Efficient Two-Sided Combinatorial Auctions. ACM Trans. Economics and Comput. Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2020	—	`conf`	Consensus Halving for Sets of Items. WINE Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2020	J	`jnl`	Consensus Halving for Sets of Items. CoRR Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2020	A*	`conf`	Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. AAAI Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2020	J	`jnl`	Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. J. Artif. Intell. Res. Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2020	—	`conf`	Learning Strong Substitutes Demand via Queries. WINE Paul W. Goldberg, Edwin Lock, Francisco J. Marmolejo Cossío
2020	J	`jnl`	Learning Strong Substitutes Demand via Queries. CoRR Paul W. Goldberg, Edwin Lock, Francisco J. Marmolejo Cossío
2020	J	`jnl`	The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. CoRR John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2019	J	`jnl`	Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. CoRR Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2019	J	`jnl`	Logarithmic Query Complexity for Approximate Nash Computation in Large Games. Theory Comput. Syst. Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu
2019	A*	`conf`	Multi-Unit Bilateral Trade. AAAI Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik
2019	J	`jnl`	Solving Strong-Substitutes Product-Mix Auctions. CoRR Elizabeth Baldwin, Paul W. Goldberg, Paul Klemperer, Edwin Lock
2019	J	`jnl`	The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich. SIAM J. Comput. Aris Filos-Ratsikas, Paul W. Goldberg
2019	A*	`conf`	The Hairy Ball Problem is PPAD-Complete. ICALP Paul W. Goldberg, Alexandros Hollender
2019	J	`jnl`	The Hairy Ball Problem is PPAD-Complete. CoRR Paul W. Goldberg, Alexandros Hollender
2019	A*	`conf`	The complexity of splitting necklaces and bisecting ham sandwiches. STOC Aris Filos-Ratsikas, Paul W. Goldberg
2018	A*	`conf`	Consensus halving is PPA-complete. STOC Aris Filos-Ratsikas, Paul W. Goldberg
2018	J	`jnl`	Few-shot Learning for Named Entity Recognition in Medical Text. CoRR Maximilian Hofer, Andrey Kormilitzin, Paul W. Goldberg, Alejo J. Nevado-Holgado
2018	B	`conf`	Hardness Results for Consensus-Halving. MFCS Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang
2018	—	`conf`	Learning Convex Partitions and Computing Game-Theoretic Equilibria from Best Response Queries. WINE Paul W. Goldberg, Francisco J. Marmolejo Cossío
2018	J	`jnl`	Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries. CoRR Paul W. Goldberg, Francisco J. Marmolejo Cossío
2018	J	`jnl`	Multi-unit Bilateral Trade. CoRR Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik
2018	J	`jnl`	The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard. Electron. Colloquium Comput. Complex. Alexandros Hollender, Paul W. Goldberg
2018	J	`jnl`	The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches. CoRR Aris Filos-Ratsikas, Paul W. Goldberg
2018	A	`conf`	Towards a Unified Complexity Theory of Total Functions. ITCS Paul W. Goldberg, Christos H. Papadimitriou
2018	J	`jnl`	Towards a unified complexity theory of total functions. J. Comput. Syst. Sci. Paul W. Goldberg, Christos H. Papadimitriou
2017	A*	`conf`	Approximately Efficient Two-Sided Combinatorial Auctions. EC Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2017	J	`jnl`	Consensus Halving is PPA-Complete. CoRR Aris Filos-Ratsikas, Paul W. Goldberg
2017	J	`jnl`	Fixed Price Approximability of the Optimal Gain From Trade. CoRR Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta
2017	—	`conf`	Fixed Price Approximability of the Optimal Gain from Trade. WINE Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta
2017	J	`jnl`	Game Theory Meets Computational Learning Theory (Dagstuhl Seminar 17251). Dagstuhl Reports Paul W. Goldberg, Yishay Mansour, Paul Dütting
2017	J	`jnl`	Pricing ad slots with consecutive multi-unit demand. Auton. Agents Multi Agent Syst. Xiaotie Deng, Paul W. Goldberg, Yang Sun, Bo Tang, Jinshan Zhang
2017	J	`jnl`	Query complexity of approximate equilibria in anonymous games. J. Comput. Syst. Sci. Paul W. Goldberg, Stefano Turchetta
2017	C	`conf`	TFNP: An Update. CIAC Paul W. Goldberg, Christos H. Papadimitriou
2017	J	`jnl`	Towards a Unified Complexity Theory of Total Functions. Electron. Colloquium Comput. Complex. Paul W. Goldberg, Christos H. Papadimitriou
2016	J	`jnl`	Approximate Well-supported Nash Equilibria Below Two-thirds. Algorithmica John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2016	J	`jnl`	Approximately Efficient Two-Sided Combinatorial Auctions. CoRR Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2016	J	`jnl`	Bounds for the Query Complexity of Approximate Equilibria. ACM Trans. Economics and Comput. Paul W. Goldberg, Aaron Roth
2016	J	`jnl`	Decentralized dynamics for finite opinion games. Theor. Comput. Sci. Diodato Ferraioli, Paul W. Goldberg, Carmine Ventre
2016	J	`jnl`	Hardness Results for Consensus-Halving. CoRR Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang
2016	B	`conf`	Logarithmic Query Complexity for Approximate Nash Computation in Large Games. SAGT Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu
2016	J	`jnl`	Logarithmic Query Complexity for Approximate Nash Computation in Large Games. CoRR Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu
2016	J	`jnl`	Multi-Unit Bayesian Auction with Demand or Budget Constraints. Comput. Intell. Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang
2016	J	`jnl`	On revenue maximization with sharp multi-unit demands. J. Comb. Optim. Ning Chen, Xiaotie Deng, Paul W. Goldberg, Jinshan Zhang
2016	B	`conf`	Revenue Maximization for Market Intermediation with Correlated Priors. SAGT Matthias Gerstgrasser, Paul W. Goldberg, Elias Koutsoupias
2016	—	`conf`	Social Welfare in One-Sided Matching Mechanisms. AAMAS Workshops (Selected Papers) George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang
2016	A	`conf`	Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract). AAMAS George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang
2015	A	`conf`	Algorithmic Game Theory (Tutorial). STACS Paul W. Goldberg
2015	B	`conf`	Auction Design with a Revenue Target. SAGT Paul W. Goldberg, Bo Tang
2015	J	`jnl`	Learning equilibria of games via payoff queries. J. Mach. Learn. Res. John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2015	—	`conf`	Query Complexity of Approximate Equilibria in Anonymous Games. WINE Paul W. Goldberg, Stefano Turchetta
2015	J	`jnl`	The Complexity of the Path-following Solutions of Two-dimensional Sperner/Brouwer Functions. CoRR Paul W. Goldberg
2015	J	`jnl`	Welfare Ratios in One-Sided Matching Mechanisms. CoRR George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang
2014	A*	`conf`	Bounds for the query complexity of approximate equilibria. EC Paul W. Goldberg, Aaron Roth
2014	J	`jnl`	On the communication complexity of approximate Nash equilibria. Games Econ. Behav. Paul W. Goldberg, Arnoud Pastink
2014	J	`jnl`	Query Complexity of Approximate Equilibria in Anonymous Games. CoRR Paul W. Goldberg, Stefano Turchetta
2014	J	`jnl`	Revenue maximization in a Bayesian double auction market. Theor. Comput. Sci. Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang
2013	J	`jnl`	Bounds for the Query Complexity of Approximate Equilibria. Electron. Colloquium Comput. Complex. Paul W. Goldberg, Aaron Roth
2013	J	`jnl`	Decentralized Dynamics for Finite Opinion Games. CoRR Diodato Ferraioli, Paul W. Goldberg, Carmine Ventre
2013	J	`jnl`	Learning Equilibria of Games via Payoff Queries CoRR John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2013	J	`jnl`	On the Communication Complexity of Approximate Nash Equilibria CoRR Paul W. Goldberg, Arnoud Pastink
2013	J	`jnl`	On the approximation performance of fictitious play in finite games. Int. J. Game Theory Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre
2013	B	`conf`	Pricing Ad Slots with Consecutive Multi-unit Demand. SAGT Xiaotie Deng, Paul W. Goldberg, Yang Sun, Bo Tang, Jinshan Zhang
2013	J	`jnl`	Pricing Ad Slots with Consecutive Multi-unit Demand. CoRR Xiaotie Deng, Paul W. Goldberg, Yang Sun, Bo Tang, Jinshan Zhang
2013	J	`jnl`	Ranking Games that have Competitiveness-based Strategies CoRR Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2013	J	`jnl`	Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2013	C	`conf`	Shortest Paths with Bundles and Non-additive Weights Is Hard. CIAC Paul W. Goldberg, Antony McCabe
2013	J	`jnl`	The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions. ACM Trans. Economics and Comput. Paul W. Goldberg, Christos H. Papadimitriou, Rahul Savani
2013	A	`conf`	Using lotteries to approximate the optimal revenue. AAMAS Paul W. Goldberg, Carmine Ventre
2012	B	`conf`	Approximate Well-Supported Nash Equilibria Below Two-Thirds. SAGT John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2012	J	`jnl`	Approximate Well-supported Nash Equilibria below Two-thirds CoRR John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2012	B	`conf`	Commodity Auctions and Frugality Ratios. SAGT Paul W. Goldberg, Antony McCabe
2012	B	`conf`	Decentralized Dynamics for Finite Opinion Games. SAGT Diodato Ferraioli, Paul W. Goldberg, Carmine Ventre
2012	—	`ed.`	Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings WINE Paul W. Goldberg
2012	J	`jnl`	On Revenue Maximization with Sharp Multi-Unit Demands CoRR Ning Chen, Xiaotie Deng, Paul W. Goldberg, Jinshan Zhang
2012	B	`conf`	On the Communication Complexity of Approximate Nash Equilibria. SAGT Paul W. Goldberg, Arnoud Pastink
2012	B	`conf`	Revenue Maximization in a Bayesian Double Auction Market. ISAAC Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang
2011	J	`jnl`	A Survey of PPAD-Completeness for Computing Nash Equilibria CoRR Paul W. Goldberg
2011	J	`jnl`	On the Approximation Performance of Fictitious Play in Finite Games CoRR Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre
2011	A	`conf`	On the Approximation Performance of Fictitious Play in Finite Games. ESA Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre
2011	A*	`conf`	The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions. FOCS Paul W. Goldberg, Christos H. Papadimitriou, Rahul Savani
2011	J	`jnl`	Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2011	J	`jnl`	Using Lotteries to Approximate the Optimal Revenue CoRR Paul W. Goldberg, Carmine Ventre
2010	B	`conf`	How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? SAGT Paul W. Goldberg
2010	A*	`conf`	Ranking games that have competitiveness-based strategies. EC Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2010	J	`jnl`	The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions CoRR Paul W. Goldberg, Christos H. Papadimitriou, Rahul Savani
2009	J	`jnl`	A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2009	J	`jnl`	Editorial: Math. Log. Quart. 4/2009. Math. Log. Q. Paul W. Goldberg, Jörg Rothe
2009	J	`jnl`	On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2009	J	`jnl`	The Complexity of Computing a Nash Equilibrium. SIAM J. Comput. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
2009	J	`jnl`	The complexity of computing a Nash equilibrium. Commun. ACM Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
2009	J	`jnl`	Uncoordinated two-sided matching markets. SIGecom Exch. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	J	`jnl`	A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	—	`conf`	A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2008	J	`jnl`	Approximate Equilibria in Games with Few Players CoRR Patrick Briest, Paul W. Goldberg, Heiko Röglin
2008	A*	`conf`	On the Dimensionality of Voting Games. AAAI Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2008	A*	`conf`	Uncoordinated two-sided matching markets. EC Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2007	—	`conf`	A Unified Approach to Congestion Games and Two-Sided Markets. WINE Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2007	A*	`conf`	Computational Complexity of Weighted Threshold Games. AAAI Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2007	J	`jnl`	Computing Good Nash Equilibria in Graphical Games CoRR Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	A*	`conf`	Computing good nash equilibria in graphical games. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	J	`jnl`	Distributed Selfish Load Balancing. SIAM J. Comput. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2007	A*	`conf`	Frugality ratios and improved truthful mechanisms for vertex cover. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	J	`jnl`	PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. Theor. Comput. Sci. Nick Palmer, Paul W. Goldberg
2007	J	`jnl`	The Price of Selfish Stackelberg Leadership in a Network Game CoRR Paul W. Goldberg, Pattarawit Polpinit
2006	J	`jnl`	A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment. SIAM J. Discret. Math. Paul W. Goldberg
2006	A*	`conf`	Distributed selfish load balancing. SODA Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2006	J	`jnl`	Frugality ratios and improved truthful mechanisms for vertex cover CoRR Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	J	`jnl`	Nash Equilibria in Graphical Games on Trees Revisited Electron. Colloquium Comput. Complex. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	A*	`conf`	Nash equilibria in graphical games on trees revisited. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	J	`jnl`	PAC Classification based on PAC Estimates of Label Class Distributions CoRR Nick Palmer, Paul W. Goldberg
2006	A*	`conf`	Reducibility among equilibrium problems. STOC Paul W. Goldberg, Christos H. Papadimitriou
2006	J	`jnl`	Some Discriminant-Based PAC Algorithms. J. Mach. Learn. Res. Paul W. Goldberg
2006	A*	`conf`	The complexity of computing a Nash equilibrium. STOC Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
2006	J	`jnl`	Utilitarian resource assignment. J. Discrete Algorithms Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
2005	J	`jnl`	Distributed Selfish Load Balancing CoRR Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2005	B	`conf`	PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance. ALT Nick Palmer, Paul W. Goldberg
2005	J	`jnl`	Reducibility Among Equilibrium Problems Electron. Colloquium Comput. Complex. Paul W. Goldberg, Christos H. Papadimitriou
2005	J	`jnl`	The complexity of computing a Nash equilibrium Electron. Colloquium Comput. Complex. Konstantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
2004	A*	`conf`	Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. PODC Paul W. Goldberg
2004	J	`jnl`	Identifying Uniformly Mutated Segments within Repeats. J. Bioinform. Comput. Biol. Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün
2004	J	`jnl`	Utilitarian resource assignment CoRR Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
2003	B	`conf`	A proportionate fair scheduling rule with good worst-case performance. SPAA Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson
2002	B	`conf`	Statistical Identification of Uniformly Mutated Segments within Repeats. CPM Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün
2001	—	`conf`	Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. COLT/EuroCOLT Paul W. Goldberg
2001	J	`jnl`	Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
2001	J	`jnl`	Learning Fixed-Dimension Linear Thresholds from Fragmented Data. Inf. Comput. Paul W. Goldberg
2001	J	`jnl`	The Complexity of Gene Placement. J. Algorithms Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
2001	—	`conf`	When Can Two Unsupervised Learners Achieve PAC Separation? COLT/EuroCOLT Paul W. Goldberg
2000	A*	`conf`	The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries. COLT Paul W. Goldberg, Stephen Kwek
1999	A*	`conf`	Learning Fixed-Dimension Linear Thresholds from Fragmented Data. COLT Paul W. Goldberg
1999	A*	`conf`	The Complexity of Gene Placement. SODA Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
1998	J	`jnl`	Constructing Computer Virus Phylogenies. J. Algorithms Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1998	A*	`conf`	Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
1998	J	`jnl`	Exact Learning of Discretized Geometric Concepts. SIAM J. Comput. Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
1997	—	`conf`	Regression with Input-dependent Noise: A Gaussian Process Treatment. NIPS Paul W. Goldberg, Christopher K. I. Williams, Christopher M. Bishop
1996	B	`conf`	Constructing Computer Virus Phylogenies. CPM Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1996	J	`jnl`	Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discret. Appl. Math. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow
1996	J	`jnl`	PAC Learning of One-Dimensional Patterns. Mach. Learn. Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott
1995	J	`jnl`	Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. Mach. Learn. Paul W. Goldberg, Mark Jerrum
1995	J	`jnl`	Four Strikes Against Physical Mapping of DNA. J. Comput. Biol. Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir
1995	B	`conf`	Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow
1994	A*	`conf`	Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise. COLT Paul W. Goldberg, Sally A. Goldman
1994	A*	`conf`	Learning Unions of Boxes with Membership and Equivalence Queries. COLT Paul W. Goldberg, Sally A. Goldman, H. David Mathias