default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th IJCAI 2016: New York, NY, USA
- Subbarao Kambhampati:
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016. IJCAI/AAAI Press 2016, ISBN 978-1-57735-770-4
Frontmatter
- Subbarao Kambhampati, Gerhard Brewka:
Preface. xxxiii-xxxiv - Conference Organization. xxxv-xxvi
- Program Committee. xxxvii-lii
- Conference Organizers and Sponsors. liii-liv
- Awards and Distinguished Papers. lv-lvi
- IJCAI Organization. lvii-liix
- Past IJCAI Conferences. lix
Papers
- Andrés Abeliuk, Haris Aziz
, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh:
Interdependent Scheduling Games. 2-9 - Pritee Agrawal, Pradeep Varakantham, William Yeoh:
Scalable Greedy Algorithms for Task/Resource Constrained Multi-Agent Stochastic Planning. 10-16 - Nirav Ajmeri, Jiaming Jiang, Rada Chirkova, Jon Doyle, Munindar P. Singh:
Coco: Runtime Reasoning about Conflicting Commitments. 17-23 - Natasha Alechina, Mehdi Dastani, Brian Logan:
Verifying Existence of Resource-Bounded Coalition Uniform Strategies. 24-30 - Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
On Truthful Mechanisms for Maximin Share Allocations. 31-37 - Giovanni Amendola, Gianluigi Greco, Nicola Leone, Pierfrancesco Veltri:
Modeling and Reasoning about NTU Games via Answer Set Programming. 38-45 - Elliot Anshelevich, John Postl:
Randomized Social Choice Functions under Metric Preferences. 46-59 - Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Generalized Discrete Preference Games. 53-59 - Haris Aziz, Jérôme Lang, Jérôme Monnot:
Computing Pareto Optimal Committees. 60-66 - Haris Aziz, Ildikó Schlotter, Toby Walsh:
Control of Fair Division. 67-73 - Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick:
A Characterization of Voting Power for Discrete Weight Distributions. 74-80 - Yoram Bachrach, Omer Lev, Yoad Lewenberg, Yair Zick:
Misrepresentation in District Voting. 81-87 - Nathanaël Barrot, Jérôme Lang:
Conditional and Sequential Approval Voting on Combinatorial Domains. 88-94 - Francesco Belardinelli, Andreas Herzig:
On Logics of Strategic Ability Based on Propositional Control. 95-101 - Bernhard Bliem, Robert Bredereck, Rolf Niedermeier:
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. 102-108 - Édouard Bonnet:
The Complexity of Playing Durak. 109-115 - Florian Brandl, Felix Brandt, Christian Geist:
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. 116-122 - Simina Brânzei, Yuezhou Lv, Ruta Mehta:
To Give or Not to Give: Fair Division for Single Minded Valuations. 123-129 - Markus Brill, Edith Elkind, Ulle Endriss, Umberto Grandi:
Pairwise Diffusion of Preference Rankings in Social Networks. 130-136 - Qingpeng Cai, Aris Filos-Ratsikas, Pingzhong Tang:
Facility Location with Minimax Envy. 137-143 - Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot:
Achieving Proportional Representation in Conference Programs. 144-150 - Ioannis Caragiannis, Swaprava Nath, Ariel D. Procaccia, Nisarg Shah:
Subset Selection via Implicit Utilitarian Voting. 151-157 - Mithun Chakraborty, Sanmay Das:
Trading on a Rigged Game: Outcome Manipulation in Prediction Markets. 158-164 - Hau Chan, Albert Xin Jiang:
Congestion Games with Polytopal Strategy Spaces. 165-171 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. 172-179 - Taolue Chen, Fu Song, Zhilin Wu:
Verifying Pushdown Multi-Agent Systems against Strategy Logics. 180-186 - Yukun Cheng, Xiaotie Deng, Qi Qi, Xiang Yan:
Truthfulness of a Proportional Sharing Mechanism in Resource Exchange. 187-193 - Yun Kuen Cheung:
Better Strategyproof Mechanisms without Payments or Prior - An Analytic Approach. 194-200 - Ross Conroy, Yifeng Zeng, Jing Tang:
Approximating Value Equivalence in Interactive Dynamic Influence Diagrams Using Behavioral Coverage. 201-207 - Natalia Criado, Jose M. Such:
Selective Norm Monitoring. 208-214 - Palash Dey, Neeldhara Misra:
Elicitation for Preferences Single Peaked on Trees. 215-221 - Palash Dey, Neeldhara Misra:
Preference Elicitation for Single Crossing Domain. 222-228 - Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Manipulation with Partial Information in Voting. 229-235 - Ulle Endriss, Svetlana Obraztsova, Maria Polukarov, Jeffrey S. Rosenschein:
Strategic Voting with Incomplete Information. 236-242 - Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. 243-249 - Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. 250-256 - Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot:
How Hard Is It for a Party to Nominate an Election Winner?. 257-263 - Wenyi Fang, Pingzhong Tang, Song Zuo:
Digital Good Exchange. 264-270 - Paolo Felli, Brian Logan, Sebastian Sardiña:
Parallel Behavior Composition for Manufacturing. 271-278 - Dimitris Fotakis, Dimitris Palyvos-Giannas, Stratis Skoulakis:
Opinion Dynamics with Local Interactions. 279-285 - Enrico H. Gerding, Sebastian Stein, Sofia Ceppi, Valentin Robu:
Online Mechanism Design for Vehicle-to-Grid Car Parks. 286-293 - Julio Godoy, Ioannis Karamouzas, Stephen J. Guy, Maria L. Gini:
Moving in a Crowd: Safe and Efficient Navigation among Heterogeneous Agents. 294-300 - Umberto Grandi, Paolo Turrini:
A Network-Based Rating System and Its Resistance to Bribery. 301-307 - Nika Haghtalab, Fei Fang, Thanh Hong Nguyen, Arunesh Sinha, Ariel D. Procaccia, Milind Tambe:
Three Strategies to Success: Learning Adversary Models in Security Games. 308-314 - Xiaowei Huang, Qingliang Chen, Jie Meng, Kaile Su:
Reconfigurability in Reactive Multiagent Systems. 315-321 - Hooyeon Lee, Ashish Goel:
Probabilistic Matrix Inspection and Group Scheduling. 322-328 - Yuqian Li, Vincent Conitzer, Dmytro Korzhyk:
Catcher-Evader Games. 329-337 - Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. 338-344 - Hongyao Ma, Reshef Meir, David C. Parkes:
Social Choice for Agents with General Utilities. 345-351 - Hongyao Ma, Valentin Robu, Na Li, David C. Parkes:
Incentivizing Reliability in Demand-Side Response. 352-358 - Erika Mackin, Lirong Xia:
Allocating Indivisible Items in Categorized Domains. 359-365 - Debmalya Mandal, David C. Parkes:
Correlated Voting. 366-372 - Mehdi Mashayekhi, Hongying Du, George F. List, Munindar P. Singh:
Silk: A Simulation Study of Regulating Open Normative Multiagent Systems. 373-379 - Georgios Methenitis, Michael Kaisers, Han La Poutré:
Incentivizing Intelligent Customer Behavior in Smart-Grids: A Risk-Sharing Tariff & Optimal Strategies. 380-386 - Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Dynamic Auctions with Bank Accounts. 387-393 - Reuth Mirsky, Ya'akov (Kobi) Gal:
SLIM: Semi-Lazy Inference Mechanism for Plan Recognition. 394-400 - Reuth Mirsky, Roni Stern, Ya'akov (Kobi) Gal, Meir Kalech:
Sequential Plan Recognition. 401-407 - Jayanth Krishna Mogali, Stephen F. Smith, Zachary B. Rubinstein:
Distributed Decoupling of Multiagent Simple Temporal Problems. 408-415 - Catherine Moon, Vincent Conitzer:
Role Assignment for Game-Theoretic Cooperation. 416-423 - Dmitry Moor, Sven Seuken, Tobias Grubenmann, Abraham Bernstein:
Core-Selecting Payment Rules for Combinatorial Auctions with Uncertain Availability of Goods. 424-432 - Harikrishna Narasimhan, Shivani Agarwal, David C. Parkes:
Automated Mechanism Design without Money via Machine Learning. 433-439 - Svetlana Obraztsova, Zinovi Rabinovich, Edith Elkind, Maria Polukarov, Nicholas R. Jennings:
Trembling Hand Equilibria of Plurality Voting. 440-446 - Steven Okamoto, Roie Zivan, Aviv Nahon:
Distributed Breakout: Beyond Satisfaction. 447-453 - Tenda Okimoto, Tony Ribeiro, Damien Bouchabou, Katsumi Inoue:
Mission Oriented Robust Multi-Team Formation and Its Application to Robot Rescue Simulation. 454-460 - James Parker, Maria L. Gini:
Controlling Growing Tasks with Heterogeneous Agents. 461-467 - Pierre Rust, Gauthier Picard, Fano Ramparany:
Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems. 468-474 - Wen Shen, Cristina V. Lopes, Jacob W. Crandall:
An Online Mechanism for Ridesharing in Autonomous Mobility-on-Demand Systems. 475-481 - Sunil Simon, Dominik Wojtczak:
Efficient Local Search in Coordination Games on Graphs. 482-488 - Warut Suksompong:
Assigning a Small Agreeable Set of Indivisible Items to Multiple Players. 489-495 - Tamir Tassa, Roie Zivan, Tal Grinshpoun:
Preserving Privacy in Region Optimal DCOP Algorithms. 496-502 - Nicolas Troquard:
Nash Equilibria and Their Elimination in Resource Games. 503-509 - Elaine Wah, Sébastien Lahaie, David M. Pennock:
An Empirical Game-Theoretic Analysis of Price Discovery in Prediction Markets. 510-516 - Kyle Hollins Wray, Luis Enrique Pineda, Shlomo Zilberstein:
Hierarchical Approach to Transfer of Control in Semi-Autonomous Systems. 517-523 - Feng Wu, Sarvapali D. Ramchurn, Xiaoping Chen:
Coordinating Human-UAV Teams in Disaster Response. 524-530 - Yue Yin, Bo An:
Efficient Resource Allocation for Protecting Coral Reef Ecosystems. 531-537 - Yue Yin, Yevgeniy Vorobeychik, Bo An, Noam Hazon:
Optimally Protecting Elections. 538-545 - Ruohan Zhang, Yue Yu, Mahmoud El Chamie, Behçet Açikmese, Dana H. Ballard:
Decision-Making Policies for Heterogeneous Autonomous Multi-Agent Systems with Safety Constraints. 546-553 - Steven Adriaensen, Ann Nowé:
Towards a White Box Approach to Automated Algorithm Design. 554-560 - Zaheen Farraz Ahmad, Robert C. Holte, Michael Bowling:
Action Selection for Hammer Shots in Curling. 561-567 - Shaowei Cai, Jinkun Lin:
Fast Solving Maximum Weight Clique Problem in Massive Graphs. 568-574 - Thomas Guyet, Yves Moinard, Jacques Nicolas, René Quiniou:
Packing Graphs with ASP for Landscape Simulation. 575-581 - David P. Hofmeyr:
On the Topology of Genetic Algorithms. 582-588 - Takashi Imamichi, Takayuki Osogami, Rudy Raymond:
Truncating Shortest Path Search for Efficient Map-Matching. 589-595 - Joachim Jansen, Bart Bogaerts, Jo Devriendt, Gerda Janssens, Marc Denecker:
Relevance for SAT(ID). 596-602 - Kustaa Kangas, Teemu Hankala, Teppo Mikael Niinimäki, Mikko Koivisto:
Counting Linear Extensions of Sparse Posets. 603-609 - Richard E. Korf:
Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory. 610-616 - Javier Larrosa, Emma Rollon, Rina Dechter:
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. 617-623 - Kangwei Liu, Junge Zhang, Peipei Yang, Kaiqi Huang:
FastLCD: Fast Label Coordinate Descent for the Efficient Optimization of 2D Label MRFs. 624-630 - Ciaran McCreesh, Patrick Prosser, James Trimble:
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. 631-638 - Ole J. Mengshoel, Youssef Ahres, Tong Yu:
Markov Chain Analysis of Noise and Restart in Stochastic Local Search. 639-646 - Abdelkader Ouali, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Albrecht Zimmermann, Lakhdar Loukil:
Efficiently Finding Conceptual Clustering Models with Integer Linear Programming. 647-654 - Fei Peng, Tuomas Sandholm:
Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. 655-661 - André Grahl Pereira, Robert Holte, Jonathan Schaeffer, Luciana S. Buriol, Marcus Ritt:
Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban. 662-668 - Masoud Safilian, S. Mehdi Hashemi, Sepehr Eghbali, Aliakbar Safilian:
An Approximation Algorithm for the Subpath Planning Problem. 669-675 - Nathan R. Sturtevant, Jingwei Chen:
External Memory Bidirectional Search. 676-682 - Nathan R. Sturtevant, Steve Rabin:
Canonical Orderings on Grids. 683-689 - Timothy Yee, Viliam Lisý, Michael H. Bowling:
Monte Carlo Tree Search in Continuous Action Spaces with Execution Uncertainty. 690-697 - Robin Arcangioli, Christian Bessiere, Nadjib Lazaar:
Multiple Constraint Acquisition. 698-704 - Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Toby Walsh:
Ranking Constraints. 705-711 - Chris Cameron, Holger H. Hoos, Kevin Leyton-Brown:
Bias in Algorithm Portfolio Performance Evaluation. 712-719 - Abderrazak Daoudi, Younes Mechqrane, Christian Bessiere, Nadjib Lazaar, El-Houssine Bouyakhf:
Constraint Acquisition with Recommendation Queries. 720-726 - Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
Combining the k-CNF and XOR Phase-Transitions. 727-734 - Azadeh Farzan, Zachary Kincaid:
Linear Arithmetic Satisfiability via Strategy Improvement. 735-743 - Zeynep Kiziltan, Marco Lippi, Paolo Torroni:
Constraint Detection in Natural Language Problem Descriptions. 744-750 - Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis:
Improving Model Counting by Leveraging Definability. 751-757 - Jimmy H. M. Lee, Zichen Zhu:
Static Symmetry Breaking with the Reflex Ordering. 758-765 - Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Clause Tableau Calculus for MaxSAT. 766-772 - Thierry Petit, Lolita Petit:
Optimizing Molecular Cloning of Multiple Plasmids. 773-779 - Sam Snodgrass, Santiago Ontañón:
Controllable Procedural Content Generation via Constrained Multi-Dimensional Markov Chain Sampling. 780-786 - Ruiwei Wang, Wei Xia, Roland H. C. Yap, Zhanshan Li:
Optimizing Simple Tabular Reduction with a Bitwise Representation. 787-795 - Ofra Amir, Barbara J. Grosz, Krzysztof Z. Gajos:
Mutual Influence Potential Networks: Enabling Information Sharing in Loosely-Coupled Extended-Duration Teamwork. 796-803 - Ofra Amir, Ece Kamar, Andrey Kolobov, Barbara J. Grosz:
Interactive Teaching Strategies for Agent Training. 804-811 - Kai Chen, Fangkai Yang, Xiaoping Chen:
Planning with Task-Oriented Knowledge Acquisition for a Service Robot. 812-818 - Shaofei Chen, Tim Baarslag, Dengji Zhao, Jing Chen, Lincheng Shen:
A Polynomial Time Optimal Algorithm for Robot-Human Search under Uncertainty. 819-825 - Matthew C. Gombolay, Reed Jensen, Jessica Stigile, Sung-Hyun Son, Julie A. Shah:
Apprenticeship Scheduling: Learning to Schedule from Human Experts. 826-833 - Eun-Sol Kim, Kyoung-Woon On, Byoung-Tak Zhang:
DeepSchema: Automatic Schema Acquisition from Wearable Sensor Data in Restaurant Situations. 834-840 - Ashish Kulkarni, Pushpak Burange, Ganesh Ramakrishnan:
Interactive Martingale Boosting. 841-847 - Thomas M. Moerland, Joost Broekens, Catholijn M. Jonker:
Fear and Hope Emerge from Anticipation in Model-Based Reinforcement Learning. 848-854 - Zahra Nazari, Jonathan Gratch:
Predictive Models of Malicious Behavior in Human Negotiations. 855-861 - Stephanie Rosenthal, Sai P. Selvaraj, Manuela M. Veloso:
Verbalization: Narration of Autonomous Robot Experience. 862-868 - Ngoc Cuong Truong, Tim Baarslag, Sarvapali D. Ramchurn, Long Tran-Thanh:
Interactive Scheduling of Appliance Usage in the Home. 869-877 - Shqiponja Ahmetaj, Magdalena Ortiz, Mantas Simkus:
Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates. 878-885 - Mario Alviano, Carmine Dodaro:
Completion of Disjunctive Logic Programs. 886-892 - Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. 893-899 - Leila Amgoud, Jonathan Ben-Naim:
Evaluation of Arguments from Support Relations: Axioms and Semantics. 900-906 - Marcelo Arenas, Jorge A. Baier, Juan S. Navarro, Sebastian Sardiña:
Incomplete Causal Laws in the Situation Calculus Using Free Fluents. 907-914 - Evgenii Balai, Michael Gelfond:
On the Relationship between P-log and LPMLN. 915-921