Jonathan P. Pearce

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:04/135 · DBLP profile ↗

← Back

5ranked-venue papers

2as first author

0since 2021 · last 2008

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 3 papers		Algorithmic game theory and mechanism design · 55% Mathematical optimization · 45%
Artificial intelligence 2 papers		Multi-agent systems · 100%
Network and information security 1 paper		Privacy and data protection · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Mathematical optimization › distributed optimization distributed constraint optimization	0.1	2	2007	Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems · IJCAI 2007 Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization · AAAI 2006
Knowledge, reasoning and agents › Multi-agent systems distributed constraint optimization	0.1	2	2006	Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization · AAAI 2006 Analysis of Privacy Loss in Distributed Constraint Optimization · AAAI 2006
Algorithmic game theory and mechanism design › stackelberg game bayesian stackelberg game	0.1	1	2008	Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications · AAAI 2008
Algorithmic game theory and mechanism design security games	0.1	1	2008	Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications · AAAI 2008
Algorithmic game theory and mechanism design stackelberg game	0.1	1	2008	Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications · AAAI 2008
Mathematical optimization combinatorial optimization	0.1	1	2007	Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems · IJCAI 2007

Methods — techniques the papers use, named apart from their topics

mixed integer linear programming · 0.1

Year	Publication	Venue	Position
2008	Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordóñez, Sarit Kraus	AAAI	2
2007	Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce, Milind Tambe	IJCAI	1
2006	Analysis of Privacy Loss in Distributed Constraint Optimization Rachel Greenstadt, Jonathan P. Pearce, Milind Tambe	AAAI	2
2006	Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization Jonathan P. Pearce	AAAI	1
2006	Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications Rajiv T. Maheswaran, Jonathan P. Pearce, Emma Bowring, Pradeep Varakantham, Milind Tambe	Auton. Agents Multi Agent Syst.	2