Paul W. Goldberg
Orcid: 0000-0002-5436-7890Affiliations:
- University of Oxford, Department of Computer Science, UK
- University of Liverpool, Department of Computer Science, UK (former)
According to our database1,
Paul W. Goldberg
authored at least 104 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
-
on cs.ox.ac.uk
-
on twitter.com
-
on orcid.org
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Continuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs.
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
2023
Theor. Comput. Sci., November, 2023
Theor. Comput. Sci., June, 2023
Substitutes markets with budget constraints: solving for competitive and optimal prices.
CoRR, 2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
ACM Trans. Economics and Comput., 2022
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries.
ACM Trans. Economics and Comput., 2021
Proceedings of the Web and Internet Economics - 17th International Conference, 2021
2020
ACM Trans. Economics and Comput., 2020
Named entity recognition in electronic health records using transfer learning bootstrapped Neural Networks.
Neural Networks, 2020
J. Artif. Intell. Res., 2020
2019
Theory Comput. Syst., 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
2017
J. Comput. Syst. Sci., 2017
Dagstuhl Reports, 2017
Auton. Agents Multi Agent Syst., 2017
Proceedings of the Web and Internet Economics - 13th International Conference, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017
2016
Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks.
CoRR, 2016
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016
Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
Proceedings of the Autonomous Agents and Multiagent Systems - AAMAS 2016 Workshops, - Best Papers, 2016
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
2015
The Complexity of the Path-following Solutions of Two-dimensional Sperner/Brouwer Functions.
CoRR, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015
2014
Games Econ. Behav., 2014
2013
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions.
ACM Trans. Economics and Comput., 2013
Int. J. Game Theory, 2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013
2012
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012
2011
2010
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010
2009
Math. Log. Q., 2009
Ann. Math. Artif. Intell., 2009
2008
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008
2007
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance.
Theor. Comput. Sci., 2007
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007
2006
A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment.
SIAM J. Discret. Math., 2006
Electron. Colloquium Comput. Complex., 2006
2005
2004
J. Bioinform. Comput. Biol., 2004
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004
2003
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003
2002
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002
2001
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model.
SIAM J. Comput., 2001
Proceedings of the Computational Learning Theory, 2001
Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required.
Proceedings of the Computational Learning Theory, 2001
2000
The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000
1998
1997
Proceedings of the Advances in Neural Information Processing Systems 10, 1997
1996
Discret. Appl. Math., 1996
1995
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers.
Mach. Learn., 1995
1994
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994