default search action
23rd IJCAI 2013: Beijing, China
- Francesca Rossi:
IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013. IJCAI/AAAI 2013, ISBN 978-1-57735-633-2 - Preface. xxvii
- 2013 Conference Organization. xxviii
- Program Committee. xxix-xxxvii
- Organizers and Sponsors. xxxviii
- Awards and Distinguished Papers. xxxix
- IJCAI Organization. xl
- Past IJCAI Conferences. xli
Agent-Based and Multiagent Systems
- Natasha Alechina, Mehdi Dastani, Brian Logan:
Reasoning about Normative Update. 20-26 - Guillaume Aucher, Thomas Bolander:
Undecidability in Epistemic Planning. 27-33 - Haris Aziz:
Maximal Recursive Rule: A New Social Decision Scheme. 34-40 - Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha:
Audit Games. 41-47 - Branislav Bosanský, Viliam Lisý, Jiri Cermak, Roman Vitek, Michal Pechoucek:
Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. 48-54 - Simina Brânzei, Ariel D. Procaccia, Jie Zhang:
Externalities in Cake Cutting. 55-61 - Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are There Any Nicely Structured Preference Profiles Nearby? 62-68 - Siqi Chen, Haitham Bou-Ammar, Karl Tuyls, Gerhard Weiss:
Conditional Restricted Boltzmann Machines for Negotiations in Highly Competitive and Complex Domains. 69-75 - Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. 76-82 - Mathijs Michiel de Weerdt, Enrico H. Gerding, Sebastian Stein, Valentin Robu, Nicholas R. Jennings:
Intention-Aware Routing to Minimise Delays at Electric Vehicle Charging Stations. 83-89 - Jilles Steeve Dibangoye, Christopher Amato, Olivier Buffet, François Charpillet:
Optimally Solving Dec-POMDPs as Continuous-State MDPs. 90-96 - Joanna Drummond, Craig Boutilier:
Elicitation and Approximately Stable Matching with Partial Preferences. 97-105 - Alessandro Farinelli, Manuele Bicego, Sarvapali D. Ramchurn, Mauro Zucchelli:
C-Link: A Hierarchical Clustering Approach to Large-scale Near-optimal Coalition Formation. 106-112 - Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. 113-119 - Sam Ganzfried, Tuomas Sandholm:
Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping. 120-128 - Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. 129-135 - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
A Matroid Approach to the Worst Case Allocation of Indivisible Goods. 136-142 - Davide Grossi, Wiebe van der Hoek:
Audience-Based Uncertainty in Abstract Argument Games. 143-149 - William Groves, Maria L. Gini:
Optimal Airline Ticket Purchasing Using Automated User-Guided Feature Selection. 150-156 - Mingyu Guo, Argyrios Deligkas:
Revenue Maximization via Hiding Item Attributes. 157-163 - Christos Hadjinikolis, Yiannis Siantos, Sanjay Modgil, Elizabeth Black, Peter McBurney:
Opponent Modelling in Persuasion Dialogues. 164-170 - Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Computational Games. 171-176 - The Anh Han, Luís Moniz Pereira, Francisco C. Santos, Tom Lenaerts:
Why Is It So Hard to Say Sorry? Evolution of Apology with Commitments in the iterated Prisoner's Dilemma. 177-183 - Jianye Hao, Ho-fung Leung:
The Dynamics of Reinforcement Social Learning in Cooperative Multiagent Systems. 184-190 - Christopher J. Hazard, Munindar P. Singh:
Macau: A Basis for Evaluating Reputation Systems. 191-197 - Noam Hazon, Raz Lin, Sarit Kraus:
How to Change a Group's Collective Decision? 198-205 - Di He, Wei Chen, Liwei Wang, Tie-Yan Liu:
A Game-Theoretic Machine Learning Approach for Revenue Maximization in Sponsored Search. 206-212 - Athirai Aravazhi Irissappane, Siwei Jiang, Jie Zhang:
A Framework to Choose Trust Models for Different E-Marketplace Environments. 213-219 - Albert Xin Jiang, Ariel D. Procaccia, Yundi Qian, Nisarg Shah, Milind Tambe:
Defender (Mis)coordination in Security Games. 220-226 - Thomas Kalinowski, Nina Narodytska, Toby Walsh:
A Social Welfare Optimal Sequential Allocation Procedure. 227-233 - Rodrigue Talla Kuate, Minghua He, Maria Chli, Hai H. Wang:
An Intelligent Broker Agent for Energy Trading: An MDP Approach. 234-240 - Yoad Lewenberg, Omer Lev, Yoram Bachrach, Jeffrey S. Rosenschein:
Agent Failures in All-Pay Auctions. 241-247 - Ang Li, Paul R. Schrater:
Efficient Learning in Linearly Solvable MDP Models. 248-253 - Yuqian Li, Vincent Conitzer:
Game-Theoretic Question Selection for Tests. 254-262 - Tyler Lu, Craig Boutilier:
Multi-Winner Social Choice with Incomplete Preferences. 263-270 - Wenjun Ma, Xudong Luo, Weiru Liu:
An Ambiguity Aversion Framework of Security Games under Ambiguities. 271-278 - Leandro Soriano Marcolino, Albert Xin Jiang, Milind Tambe:
Multi-Agent Team Formation: Diversity Beats Strength? 279-285 - Curtis Glen Menton, Preetjot Singh:
Control Complexity of Schulze Voting. 286-292 - Tomasz P. Michalak, Talal Rahwan, Piotr L. Szczepanski, Oskar Skibski, Ramasuri Narayanam, Nicholas R. Jennings, Michael J. Wooldridge:
Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks. 293-301 - Frans Adriaan Oliehoek:
Sufficient Plan-Time Statistics for Decentralized POMDPs. 302-308 - Joel Oren, Yuval Filmus, Craig Boutilier:
Efficient Vote Elicitation under Candidate Uncertainty. 309-316 - Daniele Porello:
A Proof-Theoretical View of Collective Rationality. 317-323 - Talal Rahwan, Tri-Dung Nguyen, Tomasz P. Michalak, Maria Polukarov, Madalina Croitoru, Nicholas R. Jennings:
Coalitional Games via Network Flows. 324-331 - Tjitze Rienstra, Matthias Thimm, Nir Oren:
Opponent Models with Uncertainty for Strategic Argumentation. 332-338 - Valentin Robu, David C. Parkes, Takayuki Ito, Nicholas R. Jennings:
Efficient Interdependent Value Combinatorial Auctions with Single Minded Bidders. 339-345 - Eric Anyung Shieh, Manish Jain, Albert Xin Jiang, Milind Tambe:
Efficiently Solving Joint Activity Based Security Games. 346-352 - Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Fully Proportional Representation as Resource Allocation: Approximability Results. 353-359 - Ekhlas Sonu, Prashant Doshi:
Bimodal Switching for Online Planning in Multiagent Settings. 360-366 - Long Tran-Thanh, Tri-Dung Nguyen, Talal Rahwan, Alex Rogers, Nicholas R. Jennings:
An Efficient Vector-Based Representation for Coalitional Games. 383-389 - Xin Sui, Alex Francois-Nienaber, Craig Boutilier:
Multi-Dimensional Single-Peaked Consistency and Its Approximations. 375-382 - Xin Sui, Craig Boutilier, Tuomas Sandholm:
Analysis and Optimization of Multi-Dimensional Percentile Mechanisms. 367-374 - Paolo Turrini:
Endogenous Boolean Games. 390-396 - Feng Wu, Shlomo Zilberstein, Nicholas R. Jennings:
Monte-Carlo Expectation Maximization for Decentralized POMDPs. 397-403 - Rong Yang, Albert Xin Jiang, Milind Tambe, Fernando Ordóñez:
Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach. 404-410 - William Yeoh, Akshat Kumar, Shlomo Zilberstein:
Automated Generation of Interaction Graphs for Value-Factored Dec-POMDPs. 411-417 - Han Yu, Chunyan Miao, Bo An, Cyril Leung, Victor R. Lesser:
A Reputation Management Approach for Resource Constrained Trustee Agents. 418-424 - Lan Yu, Hau Chan, Edith Elkind:
Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree. 425-431 - Yair Zick:
On Random Quotas and Proportional Representation in Weighted Voting Games. 432-439
Constraints, Satisfiability, and Search
- Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis:
Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. 440-446 - Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Just-In-Time Compilation of Knowledge Bases. 447-453 - Caroline Becker, Hélène Fargier:
Maintaining Alternative Values in Constraint-Based Configuration. 454-460 - Una Benlic, Jin-Kao Hao:
Breakout Local Search for the Vertex Separator Problem. 461-467 - Christian Bessiere, Remi Coletta, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Constraint Acquisition via Partial Queries. 475-481 - Christian Bessiere, Clément Carbonnel, Emmanuel Hebrard, George Katsirelos, Toby Walsh:
Detecting and Exploiting Subproblem Tractability. 468-474 - Edouard Bonnet, Florian Jamain, Abdallah Saffidine:
On the Complexity of Trick-Taking Card Games. 482-488 - Shaowei Cai, Kaile Su:
Comprehensive Score: Towards Efficient Local Search for SAT with Long Clauses. 489-495 - Yilin Cai, Zizhen Zhang, Songshan Guo, Hu Qin, Andrew Lim:
A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with TimeWindows and Job-Teaming Constraints. 496-502 - Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, Toby Walsh:
On the Complexity of Global Scheduling Constraints under Structural Restrictions. 503-509 - Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey:
Breaking Symmetries in Graph Representation. 510-516 - David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable Elimination in Binary CSP via Forbidden Patterns. 517-523 - Thach-Thao Nguyen Duong, Duc Nghia Pham, Abdul Sattar, M. A. Hakim Newton:
Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability. 524-530 - Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
An Approach to Abductive Reasoning in Equational Logic. 531-537 - Lucie Galand, Julien Lesca, Patrice Perny:
Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming. 538-544 - Gianluigi Greco, Francesco Scarcello:
Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability. 545-551 - Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Preserving Partial Solutions While Relaxing Constraint Networks. 552-558 - Stefan Freyr Gudmundsson, Yngvi Björnsson:
Sufficiency-Based Selection Strategy for MCTS. 559-565 - Daisuke Hatano, Katsutoshi Hirayama:
DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP. 566-572 - Christopher Jefferson, Peter Nightingale:
Extending Simple Tabular Reduction with Short Supports. 573-579 - Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, Mark H. M. Winands:
Monte Carlo *-Minimax Search. 580-586 - Ronan LeBras, Carla P. Gomes, Bart Selman:
Double-Wheel Graphs Are Graceful. 587-593 - Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. 594-600 - Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited. 601-607 - Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. 608-614 - João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov:
On Computing Minimal Correction Subsets. 615-622 - Michael D. Moffitt:
Search Strategies for Optimal Multi-Way Number Partitioning. 623-629 - Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh:
Three Generalizations of the FOCUS Constraint. 630-636 - D. Chris Rayner, Nathan R. Sturtevant, Michael Bowling:
Subset Selection of Search Heuristics. 637-643 - Emma Rollon, Javier Larrosa, Rina Dechter:
Semiring-Based Mini-Bucket Partitioning Schemes. 644-650 - Ethan L. Schreiber, Richard E. Korf:
Improved Bin Completion for Optimal Bin Packing and Number Partitioning. 651-658 - Thorsten Schütt, Robert Döbbelin, Alexander Reinefeld:
Forward Perimeter Search with Controlled Use of Memory. 659-665 - Nathan R. Sturtevant, Matthew J. Rutherford:
Minimizing Writes in Parallel External Memory Search. 666-673 - David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas:
Toward Rational Deployment of Multiple Heuristics in A. 674-680 - Debing Zhang, Genmao Yang, Yao Hu, Zhongming Jin, Deng Cai, Xiaofei He:
A Unified Approximate Nearest Neighbor Search Scheme by Combining Data Structure and Hashing. 681-688
Knowledge Representation, Reasoning and Logic
- Thomas Ågotnes, Paul Harrenstein, Wiebe van der Hoek, Michael J. Wooldridge:
Verifiable Equilibria in Boolean Games. 689-695 - Nouhad Amaneddine, Jean-François Condotta, Michael Sioutis:
Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints. 696-702 - Marcelo Arenas, Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov:
Exchanging OWL 2 QL Knowledge Bases. 703-710 - Alessandro Artale, Roman Kontchakov, Frank Wolter, Michael Zakharyaschev:
Temporal Description Logic for Ontology-Based Data Access. 711-717 - Michael Bartholomew, Joohyung Lee:
Functional Stable Model Semantics and Answer Set Programming Modulo Theories. 718-724 - Francesco Belardinelli, Alessio Lomuscio:
Decidability of Model Checking Non-Uniform Artifact-Centric Quantified Interpreted Systems. 725-731 - Vaishak Belle, Hector J. Levesque:
Reasoning about Continuous Uncertainty in the Situation Calculus. 732-738 - Salem Benferhat, Célia da Costa Pereira, Andrea G. B. Tettamanzi:
Syntactic Computation of Hybrid Possibilistic Conditioning under Uncertain Inputs. 739-745 - Christoph Benzmueller:
Automating Quantified Conditional Logics in HOL. 746-753 - Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
First-Order Rewritability of Atomic Queries in Horn Description Logics. 754-760 - Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus:
Conjunctive Regular Path Queries in Lightweight Description Logics. 761-767 - Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, Guohui Xiao:
Tractable Queries for Lightweight Description Logics. 768-774 - Meghyn Bienvenu, Riccardo Rosati:
Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. 775-781 - Alexander Bochman:
The Markov Assumption: Formalization and Impact. 782-788 - Stefan Borgwardt, Rafael Peñaloza:
Positive Subsumption in Fuzzy EL with General t-Norms. 789-795 - Pierre Bourhis, Michael Morak, Andreas Pieris:
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. 796-802 - Gerhard Brewka, Hannes Strass, Stefan Ellmauthaler, Johannes Peter Wallner, Stefan Woltran:
Abstract Dialectical Frameworks Revisited. 803-809 - Diego Calvanese, Evgeny Kharlamov, Marco Montali, Ario Santoso, Dmitriy Zheleznyakov:
Verification of Inconsistency-Aware Knowledge and Action Bases. 810-816 - Pablo Cordero, Manuel Enciso, Ángel Mora:
Automated Reasoning to Infer all Minimal Keys. 817-823 - Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 824-831 - Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos, Ian Horrocks:
Computing Datalog Rewritings Beyond Horn Ontologies. 832-838 - Denver Dash, Mark Voortman, Martijn de Jongh:
Sequences of Mechanisms for Causal Reasoning in Artificial Intelligence. 839-845 - Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi:
Bounded Epistemic Situation Calculus Theories. 846-853