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 |
15 | EE | Emma 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 |
14 | EE | Praveen 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 |
13 | EE | Praveen Paruchuri,
Jonathan P. Pearce,
Milind Tambe,
Fernando Ordóñez,
Sarit Kraus:
An efficient heuristic approach for security against multiple adversaries.
AAMAS 2007: 181 |
12 | EE | Jonathan 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 |
9 | EE | Rachel Greenstadt,
Jonathan P. Pearce,
Emma Bowring,
Milind Tambe:
Experimental analysis of privacy loss in DCOP algorithms.
AAMAS 2006: 1424-1426 |
8 | EE | Pauline 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 |
7 | EE | Jonathan P. Pearce,
Rajiv T. Maheswaran,
Milind Tambe:
Solution sets for DCOPs and graphical games.
AAMAS 2006: 577-584 |
6 | EE | Rajiv 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 |
5 | EE | Rajiv 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 |
4 | EE | Jonathan P. Pearce,
Rajiv T. Maheswaran,
Milind Tambe:
How local is that optimum? k-optimality for DCOP.
AAMAS 2005: 1303-1304 |
3 | EE | Milind 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 |
2 | EE | Rajiv 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 |