dblp.uni-trier.dewww.uni-trier.de

Jonathan P. Pearce

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
16 Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordóñez, Sarit Kraus: Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications. AAAI 2008: 1559-1562
15EEEmma Bowring, Jonathan P. Pearce, Christopher Portway, Manish Jain, Milind Tambe: On k-optimal distributed constraint optimization algorithms: new bounds and algorithms. AAMAS (2) 2008: 607-614
14EEPraveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordóñez, Sarit Kraus: Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. AAMAS (2) 2008: 895-902
2007
13EEPraveen Paruchuri, Jonathan P. Pearce, Milind Tambe, Fernando Ordóñez, Sarit Kraus: An efficient heuristic approach for security against multiple adversaries. AAMAS 2007: 181
12EEJonathan P. Pearce, Milind Tambe: Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems. IJCAI 2007: 1446-1451
2006
11 Rachel Greenstadt, Jonathan P. Pearce, Milind Tambe: Analysis of Privacy Loss in Distributed Constraint Optimization. AAAI 2006
10 Jonathan P. Pearce: Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization. AAAI 2006
9EERachel Greenstadt, Jonathan P. Pearce, Emma Bowring, Milind Tambe: Experimental analysis of privacy loss in DCOP algorithms. AAMAS 2006: 1424-1426
8EEPauline M. Berry, Cory Albright, Emma Bowring, Ken Conley, Kenneth Nitz, Jonathan P. Pearce, Bart Peintner, Shahin Saadati, Milind Tambe, Tomás E. Uribe, Neil Yorke-Smith: Conflict negotiation among personal calendar agents. AAMAS 2006: 1467-1468
7EEJonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe: Solution sets for DCOPs and graphical games. AAMAS 2006: 577-584
6EERajiv T. Maheswaran, Jonathan P. Pearce, Emma Bowring, Pradeep Varakantham, Milind Tambe: Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications. Autonomous Agents and Multi-Agent Systems 13(1): 27-60 (2006)
2005
5EERajiv T. Maheswaran, Jonathan P. Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe: Valuations of Possible States (VPS): a quantitative framework for analysis of privacy loss among collaborative personal assistant agents. AAMAS 2005: 1030-1037
4EEJonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe: How local is that optimum? k-optimality for DCOP. AAMAS 2005: 1303-1304
3EEMilind Tambe, Emma Bowring, Hyuckchul Jung, Gal A. Kaminka, Rajiv T. Maheswaran, Janusz Marecki, Pragnesh Jay Modi, Ranjit Nair, Stephen Okamoto, Jonathan P. Pearce, Praveen Paruchuri, David V. Pynadath, Paul Scerri, Nathan Schurr, Pradeep Varakantham: Conflicts in teamwork: hybrids to the rescue. AAMAS 2005: 3-10
2004
2EERajiv T. Maheswaran, Milind Tambe, Emma Bowring, Jonathan P. Pearce, Pradeep Varakantham: Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. AAMAS 2004: 310-317
1 Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Tambe: Distributed Algorithms for DCOP: A Graphical-Game-Based Approach. ISCA PDCS 2004: 432-439

Coauthor Index

1Cory Albright [8]
2Pauline M. Berry (Pauline Berry) [8]
3Emma Bowring [2] [3] [5] [6] [8] [9] [15]
4Ken Conley [8]
5Rachel Greenstadt [9] [11]
6Manish Jain [15]
7Hyuckchul Jung [3]
8Gal A. Kaminka [3]
9Sarit Kraus [13] [14] [16]
10Rajiv T. Maheswaran [1] [2] [3] [4] [5] [6] [7]
11Janusz Marecki [3] [14] [16]
12Pragnesh Jay Modi [3]
13Ranjit Nair [3]
14Kenneth Nitz [8]
15Stephen Okamoto [3]
16Fernando Ordóñez [13] [14] [16]
17Praveen Paruchuri [3] [13] [14] [16]
18Bart Peintner [8]
19Christopher Portway [15]
20David V. Pynadath [3]
21Shahin Saadati [8]
22Paul Scerri [3]
23Nathan Schurr [3]
24Milind Tambe [1] [2] [3] [4] [5] [6] [7] [8] [9] [11] [12] [13] [14] [15] [16]
25Tomás E. Uribe [8]
26Pradeep Varakantham [2] [3] [5] [6]
27Neil Yorke-Smith [8]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)