Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd IJCAI 2011: Barcelona, Catalonia, Spain
- Toby Walsh:
IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011. IJCAI/AAAI 2011, ISBN 978-1-57735-516-8 - Preface.
- Conference Organization.
- Program Committee.
- Conference Sponsorship.
- Awards and Distinguished Papers.
- Keynote and Invited Speakers.
- IJCAI Organization.
- Past IJCAI Conferences.
Invited Talk and Research Excellence Paper
- Oren Etzioni, Anthony Fader, Janara Christensen, Stephen Soderland, Mausam
:
Open Information Extraction: The Second Generation. 3-10 - Robert A. Kowalski:
Artificial Intelligence and Human Thinking. 11-16
Technical Papers and Posters
Agent-Based and Multiagent Systems
- Stéphane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello, Joel Uckelman:
Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections. 18-23 - Dimitrios Antos, Avi Pfeffer:
Using Emotions to Enhance Decision-Making. 24-30 - Christopher Archibald, Yoav Shoham:
Hustling in Repeated Zero-Sum Games with Imperfect Execution. 31-36 - John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. 37-42 - Haris Aziz, Felix Brandt, Hans Georg Seedig:
Optimal Partitions in Additively Separable Hedonic Games. 43-48 - Yoram Bachrach, Edith Elkind, Piotr Faliszewski:
Coalitional Voting Manipulation: A Game-Theoretic Perspective. 49-54 - Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger:
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. 55-60 - Katrien Beuls, Sebastian Höfer:
Simulating the Emergence of Grammatical Agreement in Multi-Agent Language Games. 61-66 - Eleanor Birrell, Rafael Pass:
Approximately Strategy-Proof Voting. 67-72 - Sylvain Bouveret, Jérôme Lang:
A General Elicitation-Free Protocol for Allocating Indivisible Goods. 73-78 - Felix Brandt:
Group-Strategyproof Irresolute Social Choice Functions. 79-84 - Felix Brandt, Markus Brill, Hans Georg Seedig:
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. 85-90 - Simina Brânzei, Kate Larson:
Social Distance Games. 91-96 - Logan Brooks, Wayne Iba, Sandip Sen:
Modeling the Emergence and Convergence of Norms. 97-102 - Nils Bulling, Mehdi Dastani:
Verifying Normative Behaviour via Normative Mechanism Design. 103-108 - Nils Bulling, Wojciech Jamroga:
Alternating Epistemic Mu-Calculus. 109-114 - Chris Burnett, Timothy J. Norman, Katia P. Sycara:
Trust Decision-Making in Multi-Agent Systems. 115-120 - Martin Caminada, Gabriella Pigozzi, Mikolaj Podlaszewski:
Manipulation in Group Argument Evaluation. 121-126 - Ioannis Caragiannis, John K. Lai, Ariel D. Procaccia:
Towards More Expressive Cake Cutting. 127-132 - Ruggiero Cavallo:
Efficient Mechanisms with Risky Participation. 133-138 - Roberto Centeno, Holger Billhardt:
Using Incentive Mechanisms for an Adaptive Regulation of Open Multi-Agent Systems. 139-145 - Meng Chang, Minghua He, Xudong Luo:
AstonCAT-Plus: An Efficient Specialist for the TAC Market Design Tournament. 146-151 - Ning Chen, Arpita Ghosh:
A Market Clearing Solution for Social Lending. 152-157 - Vincent Conitzer, Jérôme Lang, Lirong Xia:
Hypercubewise Preference Aggregation in Multi-Issue Domains. 158-163 - Célia da Costa Pereira, Andrea Tettamanzi, Serena Villata:
Changing One's Mind: Erase or Rewind? 164-171 - Giorgio Dalla Pozza, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Multi-Agent Soft Constraint Aggregation via Sequential Voting. 172-177 - Marco De Luca, Dave Cliff:
Human-Agent Auction Interactions: Adaptive-Aggressive Agents Dominate. 178-185 - Edith Elkind, Jérôme Lang, Abdallah Saffidine:
Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion. 186-191 - Can Erdogan, Manuela M. Veloso:
Action Selection via Learning Behavior Patterns in Multi-Robot Systems. 192-197 - Xiuyi Fan, Francesca Toni:
Assumption-Based Argumentation Dialogues. 198-203 - Umberto Grandi, Ulle Endriss:
Binary Aggregation with Integrity Constraints. 204-209 - John Grant, Sarit Kraus, Michael J. Wooldridge, Inon Zuckerman:
Manipulating Boolean Games through Communication. 210-215 - Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of the Core over Coalition Structures. 216-221 - Anat Hashavit, Shaul Markovitch:
Max-Prob: An Unbiased Rational Decision Making Procedure for Multiple-Adversary Environments. 222-227 - Andreas Herzig, Emiliano Lorini, Frédéric Moisan, Nicolas Troquard:
A Dynamic Logic of Normative Systems. 228-233 - Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking:
Considerate Equilibrium. 234-239 - Xiaowei Huang, Patrick Maupin, Ron van der Meyden:
Model Checking Knowledge in Pursuit Evasion Games. 240-245 - Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson:
The Complexity of Safe Manipulation under Scoring Rules. 246-251 - Wojciech Jamroga, Nils Bulling:
Comparing Variants of Strategic Ability. 252-257 - Michael Johanson, Kevin Waugh, Michael H. Bowling, Martin Zinkevich:
Accelerating Best Response Calculation in Large Extensive Games. 258-265 - Alexander Kleiner, Bernhard Nebel, Vittorio A. Ziparo:
A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions. 266-272 - Dmytro Korzhyk, Vincent Conitzer, Ronald Parr:
Security Games with Multiple Attacker Resources. 273-279 - Tyler Lu, Craig Boutilier:
Budgeted Social Choice: From Consensus to Personalized Decision Making. 280-286 - Tyler Lu, Craig Boutilier:
Robust Approximation and Incremental Elicitation in Voting Protocols. 287-293 - Ryan Luna, Kostas E. Bekris:
Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees. 294-300 - Reshef Meir, Jeffrey S. Rosenschein, Enrico Malizia:
Subsidies, Stability, and Restricted Cooperation in Coalitional Games. 301-306 - Javier Morales, Maite López-Sánchez, Marc Esteva:
Using Experience to Generate New Regulations. 307-312 - Peter Novák, Wojciech Jamroga:
Agents, Actions and Goals in Dynamic Environments. 313-318 - Svetlana Obraztsova, Edith Elkind:
On the Complexity of Voting Manipulation under Randomized Tie-Breaking. 319-324 - Joni Pajarinen, Jaakko Peltonen:
Efficient Planning for Factored Infinite-Horizon DEC-POMDPs. 325-331 - Sébastien Picault, Philippe Mathieu:
An Interaction-Oriented Model for Multi-Scale Simulation. 332-337 - Talal Rahwan, Tomasz P. Michalak, Nicholas R. Jennings:
Minimum Search to Establish Worst-Case Guarantees in Coalition Structure Generation. 338-343 - Jonathan Rubin, Ian D. Watson:
On Combining Decisions from Multiple Expert Imitators for Performance. 344-349 - Tyrel Russell, Peter van Beek:
An Empirical Study of Seeding Manipulations and Their Prevention. 350-356 - Isabelle Stanton, Virginia Vassilevska Williams:
Rigging Tournament Brackets for Weaker Players. 357-364 - Nathan R. Sturtevant, Vadim Bulitko:
Learning Where You Are Going and from Whence You Came: h- and g-Cost Learning in Real-Time Heuristic Search. 365-370 - Toshiharu Sugawara:
Emergence and Stability of Social Conventions in Conflict Situations. 371-378 - Pingzhong Tang, Tuomas Sandholm:
Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization. 379-385 - Taiki Todo, Runcong Li, Xuemei Hu, Takayuki Mouri, Atsushi Iwasaki, Makoto Yokoo:
Generalizing Envy-Freeness toward Group of Agents. 386-392 - Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makoto Yokoo:
Concise Characteristic Function Representations in Coalitional Games Based on Agent Types. 393-399 - Matteo Venanzi, Michele Piunti, Rino Falcone, Cristiano Castelfranchi:
Facing Openness with Socio-Cognitive Trust and Categories. 400-405 - Serena Villata, Guido Boella, Leendert W. N. van der Torre:
Attack Semantics for Abstract Argumentation. 406-413 - Daniel Villatoro, Giulia Andrighetto, Jordi Sabater-Mir, Rosaria Conte:
Dynamic Sanctioning for Robust and Cost-Efficient Norm Compliance. 414-419 - Daniel Villatoro, Jordi Sabater-Mir, Sandip Sen:
Social Instruments for Robust Convention Emergence. 420-425 - Simeon Visser, John Thangarajah, James Harland:
Reasoning about Preferences in Intelligent Agent Systems. 426-431 - Colin R. Williams, Valentin Robu, Enrico H. Gerding, Nicholas R. Jennings:
Using Gaussian Processes to Optimise Concession in Complex Negotiations against Unknown Opponents. 432-438 - Feng Wu, Shlomo Zilberstein, Xiaoping Chen:
Online Planning for Ad Hoc Autonomous Agent Teams. 439-445 - Lirong Xia, Vincent Conitzer:
A Maximum Likelihood Approach towards Aggregating Partial Orders. 446-451 - Lirong Xia, David M. Pennock:
An Efficient Monte-Carlo Algorithm for Pricing Combinatorial Prediction Markets for Tournaments. 452-457 - Rong Yang, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe, Richard John:
Improving Resource Allocation Strategy against Human Adversaries in Security Games. 458-464 - Zhengyu Yin, Milind Tambe:
Continuous Time Planning for Multiagent Teams with Temporal Constraints. 465-471 - Dengji Zhao, Dongmo Zhang, Laurent Perrussel:
Mechanism Design for Double Auctions with Temporal Constraints. 472-477 - Xiaoming Zheng, Sven Koenig:
Generalized Reaction Functions for Solving Complex-Task Allocation Problems. 478-483 - Hankz Hankui Zhuo, Lei Li:
Multi-Agent Plan Recognition with Partial Team Traces and Plan Libraries. 484-489 - Yair Zick, Alexander Skopalik, Edith Elkind:
The Shapley Value as a Function of the Quota in Weighted Voting Games. 490-496
Constraints, Satisfiability, and Search
- Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen:
Tackling the Partner Units Configuration Problem. 497-503 - Anton Belov, Matti Järvisalo, Zbigniew Stachniak:
Depth-Driven Circuit-Level Stochastic Local Search for SAT. 504-509 - Manuel Bodirsky, Martin Hils, Alex Krimkevitch:
Tractable Set Constraints. 510-515 - Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la Banda, Christopher Mears:
Symmetries and Lazy Clause Generation. 516-521 - Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. 522-527 - Marcelo Finger, Glauber De Bona:
Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition. 528-533 - Timothy Furtak, Michael Buro:
Using Payoff-Similarity to Speed Up Search. 534-539 - Serge Gaspers, Stefan Szeider:
Kernels for Global Constraints. 540-545 - Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus:
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. 546-553 - Patricia Gutierrez, Pedro Meseguer, William Yeoh:
Generalizing ADOPT and BnB-ADOPT. 554-559 - Daisuke Hatano, Katsutoshi Hirayama:
Dynamic SAT with Decision Change Costs: Formalization and Solutions. 560-565 - Edith Hemaspaandra, Henning Schnoor:
Minimization for Generalized Boolean Formulas. 566-571 - Federico Heras, João Marques-Silva:
Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms. 572-577 - Carlos Hernández, Jorge A. Baier:
Real-Time Heuristic Search with Depression Avoidance. 578-583 - Yoshikazu Kobayashi, Akihiro Kishimoto, Osamu Watanabe:
Evaluations of Hash Distributed A* in Optimal Sequence Alignment. 584-590 - Richard E. Korf:
A Hybrid Recursive Multi-Way Number Partitioning Algorithm. 591-596 - Arnaud Lallouet, Yat Chiu Law, Jimmy Ho-Man Lee, Charles F. K. Siu:
Constraint Programming on Infinite Data Streams. 597-604 - Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Minimum Satisfiability and Its Applications. 605-610 - Tian Liu, Xiaxiang Lin, Chaoyi Wang, Kaile Su, Ke Xu:
Large Hinge Width on Sparse Random Hypergraphs. 611-616 - Jeffrey Richard Long, Michael Buro:
Real-Time Opponent Modeling in Trick-Taking Card Games. 617-622 - Peter Nightingale, Ian P. Gent, Christopher Jefferson, Ian Miguel:
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. 623-628 - Pierre Ouellet, Claude-Guy Quimper:
The Multi-Inter-Distance Constraint. 629-634 - François Pachet, Pierre Roy, Gabriele Barbieri:
Finite-Length Markov Processes with Constraints. 635-642 - Thierry Petit, Nicolas Beldiceanu, Xavier Lorca:
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. 643-648 - Christopher D. Rosin:
Nested Rollout Policy Adaptation for Monte Carlo Tree Search. 649-654 - Satomi Baba, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo:
Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search. 655-661 - Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner:
The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. 662-667 - Trevor Scott Standley, Richard E. Korf:
Complete Algorithms for Cooperative Pathfinding Problems. 668-673 - Jordan Tyler Thayer, Wheeler Ruml:
Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates. 674-679 - David Tolpin, Solomon Eyal Shimony:
Rational Deployment of CSP Heuristics. 680-686 - Justin Yip, Pascal Van Hentenryck:
Symmetry Breaking via LexLeader Feasibility Checkers. 687-692 - Jilian Zhang, Kyriakos Mouratidis, HweeHwa Pang:
Heuristic Algorithms for Balanced Multi-Way Number Partitioning. 693-698 - Zhaoyi Zhang, Songshan Guo, Wenbin Zhu, Wee-Chong Oon, Andrew Lim:
Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems. 699-704
Knowledge Representation, Reasoning, and Logic
- Ofer Arieli, Arnon Avron, Anna Zamansky:
What Is an Ideal Logic for Reasoning with Inconsistency?. 706-711 - Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, Michaël Thomazo:
Walking the Complexity Lines for Generalized Guarded Existential Rules. 712-717 - Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
Query Reasoning on Trees with Types, Interleaving, and Counting. 718-723 - Michael Bartholomew, Joohyung Lee, Yunsong Meng:
First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription. 724-730 - Nuno Belard, Yannick Pencolé, Michel Combacau:
A Theory of Meta-Diagnosis: Reasoning about Diagnostic Systems. 731-737