The DOI matches its Crossref record; 52 of the 60 references it cites were found in a registry or an index, and 1 are not checked yet.
A heuristic technique for multi‐agent planning
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Traditional AI Agents feature limited learning mechanisms, such as heuristic parameter adjustment [161], [162] or history-informed context retention.”
From AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges (2025) · cites this paper as [161]
Citations
Cites
A Theory of Justice: Original Edition
Rawls, J. (1971) · doi:10.4159/9780674042605 · Cited by 9,496
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
Smith (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675516 · Cited by 3,716
Counterspeculation, Auctions, and Competitive Sealed Tenders
Vickrey, W. S. (1961) · The Journal of Finance · doi:10.2307/2977633 · Cited by 1,923
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
An analysis of time-dependent planning
Dean, T., & Boddy, M. (1988) · National Conference on Artificial Intelligence · Cited by 789
UCPOP: a sound, complete, partial order planner for ADL
Penberthy, J. S., & Weld, D. S. (1992) · Cited by 676
McAllester, D., & Rosenblitt, D. (1991) · Cited by 525
A Computer Model of Skill Acquisition
Sussman, G. J. (1975) · Cited by 454
Planning as search: A quantitative approach
Korf, R. E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90051-8 · Cited by 363
Research works printed but not linked: 10
- T. Dean and M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference on Artificial Intelligence (St. Paul, Minnesota, August 1988) pp. 49–54.
- E.H. Durfee, A cooperative approach to planning for real-time control, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 277–283.
- E. Ephrati, M.E. Pollack and J.S. Rosenschein, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Working Notes of the AAAI Spring Symposium on Decision-Theoretic Planning (Stanford, CA, March 1994) pp. 90–98.
- E. Ephrati, M.E. Pollack and S. Ur, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Proceedings of The Fourteenth International Joint Conference on Artificial Intelligence (Montreal, Canada, August 1995) pp. 679–685.
- P. Haddawy and S. Hanks, Issues in decision-theoretic planning: Symbolic goals and numeric utilities, in: Proceedings of the 1990 DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (November 1990) pp. 48–58.
- S. Hanks and R.J. Firby, Issues and architectures for planning and execution, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 59–70.
- S. Kraus, M. Nirkhe and D. Perlis, Deadline-coupled real-time planning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 100–108.
- A.L. Lansky, Localized search for controlling automated reasoning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 115–125.
- T. Moehlman and V. Lesser, Cooperative planning and decentralized negotiation in Multi-Fireboss Phoenix, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 144–159.
- R.P. Pope, S.E. Conry and R.A. Mayer, Distributing the planning process in a dynamic environment, in: Proceedings of the Eleventh International Workshop on Distributed Artificial Intelligence (Glen Arbor, Michigan, February 1992) pp. 317–331.
Cited by
AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2026) · Information Fusion · doi:10.1016/j.inffus.2025.103599 · Cited by 671
“…example of a tool-augmented AI agent is ChatGPT, which, when unable to answer a query directly, autonomously invokes the Web Search API to retrieve more recent and relevant information, performs reasoning over the retrieved content, and formulates a response based on its understanding [137].”
AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2025) · arXiv · doi:10.48550/arxiv.2505.10468 · Cited by 295
How Hard Is Bribery in Elections?
Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2676 · Cited by 236
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2697 · Cited by 228
Using complexity to protect elections
Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2010) · Communications of the ACM · doi:10.1145/1839676.1839696 · Cited by 185
AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2025) · SuperIntelligence - Robotics - Safety & Alignment · doi:10.70777/si.v2i3.15161 · Cited by 186
Cooperative Multi-Agent Planning
Torreño, A., Onaindía, E., Komenda, A., & Štolba, M. (2017) · ACM Computing Surveys · doi:10.1145/3128584 · Cited by 162
The Distortion of Cardinal Preferences in Voting
Procaccia, A. D., & Rosenschein, J. S. (2006) · Lecture notes in computer science · doi:10.1007/11839354_23 · Cited by 159
Self-citationFaliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2010) · Information and Computation · doi:10.1016/j.ic.2010.09.001 · Cited by 150
Junta Distributions and the Average-Case Complexity of Manipulating Elections
Procaccia, A. D., & Rosenschein, J. S. (2007) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2148 · Cited by 142
Self-citationAlgorithms for the coalitional manipulation problem
Zuckerman, M., Procaccia, A. D., & Rosenschein, J. S. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.11.005 · Cited by 124
Self-citationComplexity of Strategic Behavior in Multi-Winner Elections
Meir, R., Procaccia, A. D., Rosenschein, J. S., & Zohar, A. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2566 · Cited by 115
Self-citationVote Elicitation: Complexity and Strategy-ProofnessPreprint
Conitzer, V., & Sandholm, T. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0205073 · Cited by 114
Equilibria of plurality voting with abstentions
Desmedt, Y., & Elkind, E. (2010) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1807342.1807398 · Cited by 88
Clone structures in voters' preferences
Elkind, E., Faliszewski, P., & Slinko, A. M. (2012) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/2229012.2229050 · Cited by 82
Bogner, K., Pferschy, U., Unterberger, R., & Zeiner, H. (2018) · International Journal of Production Research · doi:10.1080/00207543.2018.1470695 · Cited by 86
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
Brandt, F., Brill, M., Hemaspaandra, E., & Hemaspaandra, L. A. (2015) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4647 · Cited by 79
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
Brandt, F., Brill, M., Hemaspaandra, E., & Hemaspaandra, L. A. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7637 · Cited by 77
Control complexity in Bucklin and fallback voting: A theoretical analysis
Erdélyi, G., Fellows, M. R., Rothe, J., & Schend, L. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2014.11.002 · Cited by 73
Distributed Heuristic Forward Search for Multi-agent Planning
Nissim, R., & Brafman, R. I. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4295 · Cited by 72
Manipulating the quota in weighted voting games
Zuckerman, M., Faliszewski, P., Bachrach, Y., & Elkind, E. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2011.12.003 · Cited by 71
Power in threshold network flow games
Bachrach, Y., & Rosenschein, J. S. (2008) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-008-9057-6 · Cited by 66
Self-citationFalse-Name Manipulations in Weighted Voting Games
Aziz, H., Bachrach, Y., Elkind, E., & Paterson, M. S. (2011) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3166 · Cited by 60
Probabilistic Possible Winner Determination
Bachrach, Y., Betzler, N., & Faliszewski, P. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7609 · Cited by 58
Computational Aspects of Approval Voting
Baumeister, D., Erdélyi, G., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2010) · Studies in choice and welfare · doi:10.1007/978-3-642-02839-7_10 · Cited by 57
Multi-winner elections: complexity of manipulation, control, and winner-determination
Procaccia, A. D., Rosenschein, J. S., & Zohar, A. (2007) · Cited by 58
Self-citationApproximability of manipulating elections
Brelsford, E., Faliszewski, P., Hemaspaandra, E., Schnoor, H., & Schnoor, I. (2008) · Cited by 50
On the complexity of voting manipulation under randomized tie-breaking
Obraztsova, S., & Elkind, E. (2011) · doi:10.5591/978-1-57735-516-8/ijcai11-063 · Cited by 47
Optimal manipulation of voting rules
Obraztsova, S., & Elkind, E. (2012) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2343776.2343785 · Cited by 44
Search versus Decision for Election Manipulation Problems
Hemaspaandra, E., Hemaspaandra, L. A., & Menton, C. (2020) · ACM Transactions on Computation Theory · doi:10.1145/3369937 · Cited by 44
Computational Aspects of Nearly Single-Peaked Electorates
Erdélyi, G., Lackner, M., & Pfandler, A. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8608 · Cited by 43
Cloning in Elections: Finding the Possible WinnersPreprint
Elkind, E., Faliszewski, P., & Slinko, A. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.4602 · Cited by 42
Manipulation of copeland elections
Faliszewski, P., Hemaspaandra, E., & Schnoor, H. (2010) · doi:10.5555/1838206.1838258 · Cited by 40
On the role of distances in defining voting rules
Elkind, E., Faliszewski, P., & Slinko, A. M. (2010) · doi:10.5555/1838206.1838259 · Cited by 40
Computing the Banzhaf power index in network flow games
Bachrach, Y., & Rosenschein, J. S. (2007) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1329125.1329433 · Cited by 39
Self-citationThe learnability of voting rules
Procaccia, A. D., Zohar, A., Peleg, Y., & Rosenschein, J. S. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.03.003 · Cited by 38
Self-citationConflict resolution in multi-agent systems
Resmeriṭă, Ş., & Heymann, M. (2004) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2003.1273003 · Cited by 33
The complexity of probabilistic lobbying
Binkele-Raible, D., Erdélyi, G., Fernau, H., Goldsmith, J., Mattei, N., & Rothe, J. (2013) · Discrete Optimization · doi:10.1016/j.disopt.2013.10.003 · Cited by 32
Elkind, E., Faliszewski, P., & Slinko, A. M. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7606 · Cited by 30
More Natural Models of Electoral Control by Partition
Erdélyi, G., Hemaspaandra, E., & Hemaspaandra, L. A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23114-3_24 · Cited by 28
Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2013) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/xurz5223 · Cited by 28
Good Rationalizations of Voting Rules
Elkind, E., Faliszewski, P., & Slinko, A. M. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7607 · Cited by 27
Computational Aspects of Nearly Single-Peaked Electorates
Erdélyi, G., Lackner, M., & Pfandler, A. (2017) · Journal of Artificial Intelligence Research · doi:10.1613/jair.5210 · Cited by 27
Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2015) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4621 · Cited by 26
Complexity of manipulation with partial information in voting
Dey, P., Misra, N., & Narahari, Y. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.03.012 · Cited by 26
Studies in Computational Aspects of Voting
Betzler, N., Bredereck, R., Chen, J., & Niedermeier, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30891-8_16 · Cited by 25
The complexity of voter partition in Bucklin and fallback voting: solving three open problems
Erdélyi, G., Piras, L., & Rothe, J. (2011) · doi:10.5555/2031678.2031737 · Cited by 25
On the robustness of preference aggregation in noisy environments
Procaccia, A. D., Rosenschein, J. S., & Kaminka, G. A. (2007) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1329125.1329205 · Cited by 24
Self-citationManipulation with Bounded Single-Peaked Width: A Parameterized Study
Yang, Y. (2015) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2772879.2772893 · Cited by 18
Possible Winners in Noisy Elections
Wojtas, K., & Faliszewski, P. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8255 · Cited by 18
Llull and Copeland Voting Computationally Resist Bribery and ControlPreprint
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.4484 · Cited by 17
Rapid generation method of process routes based on multi-agent collaboration with LLMs
Xie, Y., Liu, J., Wang, R., Wang, Z., Yu, K., & Song, Z. (2025) · Advanced Engineering Informatics · doi:10.1016/j.aei.2025.103733 · Cited by 17
How Hard is Control in Single-Crossing Elections?
Magiera, K., & Faliszewski, P. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-579 · Cited by 16
Abstract Architecture for Task-oriented Multi-agent Problem Solving
Vokřínek, J., Komenda, A., & Pěchouček, M. (2010) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2010.2073465 · Cited by 15
Possible Winners in Noisy ElectionsPreprint
Wojtas, K., Magiera, K., Miąsko, T., & Faliszewski, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.6630 · Cited by 15
Bribery and voter control under voting-rule uncertainty
Erdélyi, G., Hemaspaandra, E., & Hemaspaandra, L. A. (2014) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2615731.2615744 · Cited by 14
Procaccia, A. D., Zohar, A., Peleg, Y., & Rosenschein, J. S. (2007) · Cited by 14
Self-citationNeveling, M., & Rothe, J. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2021.103508 · Cited by 13
Control in the presence of manipulators: cooperative and competitive cases
Fitzsimmons, Z., Hemaspaandra, E., & Hemaspaandra, L. A. (2020) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09475-6 · Cited by 13
Erdélyi, G., Neveling, M., Reger, C., Rothe, J., Yang, Y., & Zorn, R. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-021-09523-9 · Cited by 13
Complexity of safe manipulation under scoring rules
Ianovski, E., Yu, L., Elkind, E., & Wilson, M. C. (2011) · doi:10.5591/978-1-57735-516-8/ijcai11-052 · Cited by 11
Homogeneity and monotonicity of distance-rationalizable voting rules
Elkind, E., Faliszewski, P., & Slinko, A. M. (2011) · doi:10.5555/2031678.2031735 · Cited by 11
How hard is control in single-crossing elections?
Magiera, K., & Faliszewski, P. (2016) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-016-9339-3 · Cited by 10
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2009) · Theoretical Aspects of Rationality and Knowledge · doi:10.1145/1562814.1562832 · Cited by 10
Detecting Possible Manipulators in ElectionsPreprint
Dey, P., Misra, N., & Narahari, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.2367 · Cited by 10
Weighted Manipulation for Four-Candidate Llull Is Easy
Faliszewski, P., Hemaspaandra, E., & Schnoor, H. (2012) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-098-7-318 · Cited by 9
Planning and re-planning in multi-actors scenarios by means of social commitments
Komenda, A., Pěchouček, M., Bíba, J., & Vokřínek, J. (2008) · Proceedings of the International Multiconference on Computer Science and Information Technology · doi:10.1109/imcsit.2008.4747215 · Cited by 9
Bucklin Voting is Broadly Resistant to ControlPreprint
Erdélyi, G., Piras, L., & Rothe, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.4115 · Cited by 9
Proof systems and transformation games
Bachrach, Y., Zuckerman, M., Wooldridge, M., & Rosenschein, J. S. (2012) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-012-9323-9 · Cited by 8
Self-citationThe complexity of online voter control in sequential elections
Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2016) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-016-9349-1 · Cited by 8
Agent subset adversarial search for complex non-cooperative domains
Lisý, V., Bošanský, B., Vaculín, R., & Pěchouček, M. (2010) · IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/itw.2010.5593351 · Cited by 7
Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC-2006)
Endriss, U., & Lang, J. (2006) · UvA-DARE (University of Amsterdam) · Cited by 7
Manipulation of k-Approval in Nearly Single-Peaked Electorates
Erdélyi, G., Lackner, M., & Pfandler, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23114-3_5 · Cited by 5
Dehimi, N. E. H., Galland, S., Tolba, Z., Allaoua, N., & Ferkani, M. (2023) · Electronics · doi:10.3390/electronics12234797 · Cited by 5
Voting in Cooperative Information Agent Scenarios: Use and Abuse
Rosenschein, J. S., & Procaccia, A. D. (2006) · Lecture notes in computer science · doi:10.1007/11839354_4 · Cited by 5
Self-citationPossible Bribery in k-Approval and k-Veto Under Partial Information
Erdélyi, G., & Reger, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44748-3_29 · Cited by 4
Plan representation and execution in multi-actor scenarios by means of social commitments
Komenda, A., Vokřínek, J., & Pěchouček, M. (2011) · Web Intelligence and Agent Systems An International Journal · doi:10.3233/wia-2011-0210 · Cited by 4
Optimal Manipulation of Voting Rules
Obraztsova, S., & Elkind, E. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8441 · Cited by 4
How Credible is the Prediction of a Party-Based Election?Preprint
Guo, J., Shrestha, Y. R., & Yang, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.2464 · Cited by 4
More Natural Models of Electoral Control by PartitionPreprint
Erdélyi, G., Hemaspaandra, E., & Hemaspaandra, L. A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.2652 · Cited by 4
Time-Aware Knowledge Graphs for Decision Making in the Building Industry
Zeiner, H., Weiss, W., Unterberger, R., Maurer, D., & Jöbstl, R. (2019) · Lecture notes in business information processing · doi:10.1007/978-3-030-18819-1_5 · Cited by 3
Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations
Simjour, N. (2013) · UWSpace (University of Waterloo) · Cited by 3
I-Globe: Distributed Planning and Coordination of Team-oriented Activities
Komenda, A., Vokříne, J., Pěchouček, M., Wickler, G., Dalton, J., & Tate, A. (2009) · Cited by 3
Mullet's Gambit: Explaining Learned Strategies in the Chef's Hat Multiplayer Card Game
Triglia, L., Barros, P. V. A., Rea, F., & Sciutti, A. (2024) · International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW) · doi:10.1109/aciiw63320.2024.00028 · Cited by 2
General Problems of Metrology and Measurement Technique
Муравьев, С. В. (2014) · Measurement Techniques · doi:10.1007/s11018-014-0419-y · Cited by 2
Maushagen, C., & Jörg, R. (2020) · Frontiers in artificial intelligence and applications · doi:10.3233/faia200089 · Cited by 2
Studies in computational aspects of voting: open problems of downey and fellows
Betzler, N., Bredereck, R., Chen, J., & Niedermeier, R. (2012) · Springer eBooks · Cited by 2
Clone Structures in Voters' PreferencesPreprint
Elkind, E., Faliszewski, P., & Slinko, A. M. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.3939 · Cited by 2
Eduiyovwiri, L. E., Unaegbu, E. N., Nwanunu, P., & Ofodile, C. H. (2024) · African Journal of Mathematics and Statistics Studies · doi:10.52589/ajmss-hixh7ucj · Cited by 1
Pěchouček, M., Řehák, M., & Mařík, V. (2007) · Web Intelligence · doi:10.5555/1339264.1339733 · Cited by 1
Pěchouček, M., Řehák, M., & Mařík, V. (2007) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iatw.2007.103 · Cited by 1
Equilibria of Plurality Voting with AbstentionsPreprint
Desmedt, Y., & Elkind, E. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.4939
Complexity of Candidate Control for Single Nontransferable Vote and Bloc Voting
Bet, G. K., Rothe, J., & Zorn, R. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73903-3_1
Study on the Coordinated Optimization of Distribution Automation and Distributed Energy Access
Zhongwen, H., Zhenggang, W., Kailin, L., Peng, S., & Hongjun, Z. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-18907-3_41
Szatkiewicz, T. (2013) · Pomiary Automatyka Kontrola
Metadata
- Authors
- Ephrati, E., & Rosenschein, J. S.
- Affiliations
- Bar-Ilan University (IL)
- Hebrew University of Jerusalem (IL)
- Corresponding author
- Ephrati, Eithan
- Rosenschein, Jeffrey S.
- Venue
- Annals of Mathematics and Artificial Intelligence
- Published
- 1997-07
- Volume
- 20
- Issue
- 1-4
- Pages
- 13-67
- ISSN
- 1012-2443 (ISSN-L)
- 1573-7470
- OpenAlex
- W1889721679
- Cited by
- 93
- References
- 60
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 3 · 2023: 1 · 2021: 4 · 2020: 3 · 2019: 1 · 2018: 2 · 2017: 2 · 2016: 3 · 2015: 5 · 2014: 10 · 2013: 5 · 2012: 7
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Annals of Mathematics and Artificial Intelligence (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Keywords
- multi-agent planning, heuristic planning, subgoal decomposition, distributed artificial intelligence, rational agents
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.