Distributed Algorithms for DCOP: A Graphical-Game-Based Approach. - Rajiv T. Maheswaran; Jonathan P. Pearce; Milind Tambe (PDCS, 2004)

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. - Rajiv T. Maheswaran; Milind Tambe; Emma Bowring; Jonathan P. Pearce; Pradeep Varakantham (AAMAS, 2004)

Valuations of Possible States (VPS): A Quantitative Framework for Analysis of Privacy Loss Among Collaborative Personal Assistant Agents. - Rajiv T. Maheswaran; Jonathan P. Pearce; Pradeep Varakantham; Emma Bowring; Milind Tambe (AAAI Spring Symposium: Persistent Assistants: Living and Working with AI, 2005)

How local is that optimum? k-optimality for DCOP. - Jonathan P. Pearce; Rajiv T. Maheswaran; Milind Tambe (AAMAS, 2005)

Conflicts in teamwork: hybrids to the rescue. - 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; et al. (AAMAS, 2005)

Analysis of Privacy Loss in Distributed Constraint Optimization. - Rachel Greenstadt; Jonathan P. Pearce; Milind Tambe (AAAI, 2006)

Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization. - Jonathan P. Pearce (AAAI, 2006)

Electric Elves: What Went Wrong and Why. - Milind Tambe; Emma Bowring; Jonathan P. Pearce; Pradeep Varakantham; David V. Pynadath; Paul Scerri (AAAI Spring Symposium: What Went Wrong and Why: Lessons from AI Research and Applications, 2006)

Conflict negotiation among personal calendar agents. - 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 (AAMAS, 2006)

Experimental analysis of privacy loss in DCOP algorithms. - Rachel Greenstadt; Jonathan P. Pearce; Emma Bowring; Milind Tambe (AAMAS, 2006)

Solution sets for DCOPs and graphical games. - Jonathan P. Pearce; Rajiv T. Maheswaran; Milind Tambe (AAMAS, 2006)

Solution Sets for DCOPs and Graphical Games: Metrics and Bounds. - Jonathan P. Pearce; Rajiv T. Maheswaran; Milind Tambe (AI&M, 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., 2006)

An Efficient Heuristic for Security against Multiple Adversaries in Stackelberg Games. - Praveen Paruchuri; Jonathan P. Pearce; Milind Tambe; Fernando Ordóñez; Sarit Kraus (AAAI Spring Symposium: Game Theoretic and Decision Theoretic Agents, 2007)

An efficient heuristic approach for security against multiple adversaries. - Praveen Paruchuri; Jonathan P. Pearce; Milind Tambe; Fernando Ordóñez; Sarit Kraus (AAMAS, 2007)

Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems. - Jonathan P. Pearce; Milind Tambe (IJCAI, 2007)

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, 2008)

On k-optimal distributed constraint optimization algorithms: new bounds and algorithms. - Emma Bowring; Jonathan P. Pearce; Christopher Portway; Manish Jain; Milind Tambe (AAMAS (2), 2008)

Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. - Praveen Paruchuri; Jonathan P. Pearce; Janusz Marecki; Milind Tambe; Fernando Ordóñez; Sarit Kraus (AAMAS (2), 2008)

Solving Multiagent Networks using Distributed Constraint Optimization. - Jonathan P. Pearce; Milind Tambe; Rajiv T. Maheswaran (AI Mag., 2008)

Coordinating randomized policies for increasing security of agent systems. - Praveen Paruchuri; Jonathan P. Pearce; Janusz Marecki; Milind Tambe; Fernando Ordóñez; Sarit Kraus (Inf. Technol. Manag., 2009)