default search action
Noam Hazon
Person information
- affiliation: Ariel University, Israel
- unicode name: נועם חזון
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Noam Hazon
, Sefi Erlich, Ariel Rosenfeld
Negotiation strategies for agents with ordinal preferences: Theoretical analysis and human study. Artif. Intell. 327: 104050 (2024) - [j16]Arcady Beriozkin
Machine learning approach to predicting the hysteresis of water retention curves of porous media. Expert Syst. Appl. 237(Part A): 121469 (2024) - [c44]Chaya Levinger, Noam Hazon, Sofia Simola, Amos Azaria:
Coalition Formation with Bounded Coalition Size. AAMAS 2024: 1119-1127 - [c43]Yael Sabato, Amos Azaria, Noam Hazon:
Source Detection in Networks using the Stationary Distribution of a Markov Chain. AAMAS 2024: 2447-2449 - [c42]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. ECAI 2024: 3388-3396 - [i17]Yael Sabato, Amos Azaria, Noam Hazon:
Source Detection in Networks using the Stationary Distribution of a Markov Chain. CoRR abs/2401.11330 (2024) - [i16]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. CoRR abs/2408.07368 (2024) - 2023
- [j15]David Zar, Noam Hazon
Information Disclosure for Increasing User Satisfaction From a Shared Ride. IEEE Access 11: 32030-32040 (2023) - [c41]Hila Shoshan, Noam Hazon, Erel Segal-Halevi:
Efficient Nearly-Fair Division with Capacity Constraints. AAMAS 2023: 206-214 - [c40]Chaya Levinger, Amos Azaria, Noam Hazon:
Social Aware Coalition Formation with Bounded Coalition Size. AAMAS 2023: 2667-2669 - [c39]Meir Nizri, Amos Azaria, Noam Hazon:
Contrastive Explanations for Recommendation Systems. CogSci 2023 - [c38]Ido Kahana, Noam Hazon:
The Leximin Approach for a Sequence of Collective Decisions. ECAI 2023: 1198-1206 - [i15]Ido Kahana, Noam Hazon:
The Leximin Approach for a Sequence of Collective Decisions. CoRR abs/2305.18024 (2023) - [i14]Chaya Levinger, Amos Azaria, Noam Hazon:
Socially Aware Coalition Formation with Bounded Coalition Size. CoRR abs/2306.01378 (2023) - 2022
- [c37]Chaya Levinger, Noam Hazon, Amos Azaria:
Social Aware Assignment of Passengers in Ridesharing (Student Abstract). AAAI 2022: 12995-12996 - [c36]Meir Nizri, Noam Hazon, Amos Azaria:
Explainable Shapley-Based Allocation (Student Abstract). AAAI 2022: 13023-13024 - [c35]Meir Nizri, Amos Azaria, Noam Hazon:
Improving the Perception of Fairness in Shapley-Based Allocations. CogSci 2022 - [c34]Leora Schmerler, Noam Hazon, Sarit Kraus:
Strategic Voting in the Context of Stable-Matching of Teams. SAGT 2022: 562-579 - [d1]David Zar
Satisfaction from shared rides. IEEE DataPort, 2022 - [i13]Hila Shoshan, Erel Segal-Halevi, Noam Hazon:
Efficient Nearly-Fair Division with Capacity Constraints. CoRR abs/2205.07779 (2022) - [i12]Leora Schmerler, Noam Hazon, Sarit Kraus:
Strategic Voting in the Context of Stable-Matching of Teams. CoRR abs/2207.04912 (2022) - 2021
- [j14]Laurent Bulteau, Noam Hazon
Justified Representation for Perpetual Voting. IEEE Access 9: 96598-96612 (2021) - [j13]Chaya Levinger
Efficient Computation and Estimation of the Shapley Value for Traveling Salesman Games. IEEE Access 9: 129119-129129 (2021) - [c33]Avishai Zagoury, Orgad Keller, Avinatan Hassidim, Noam Hazon:
Targeted Negative Campaigning: Complexity and Approximations. AAAI 2021: 5768-5778 - [c32]Leora Schmerler, Noam Hazon:
Strategic Voting in Negotiating Teams. ADT 2021: 209-223 - [c31]David Zar, Noam Hazon, Amos Azaria:
Explaining Ridesharing: Selection of Explanations for Increasing User Satisfaction. EUMAS 2021: 89-107 - [c30]Naftali Waxman, Sarit Kraus, Noam Hazon:
Manipulation of k-Coalitional Games on Social Networks. IJCAI 2021: 450-457 - [i11]Naftali Waxman, Noam Hazon, Sarit Kraus:
Manipulation of k-Coalitional Games on Social Networks. CoRR abs/2105.09852 (2021) - [i10]David Zar, Noam Hazon, Amos Azaria:
Explaining Ridesharing: Selection of Explanations for Increasing User Satisfaction. CoRR abs/2105.12500 (2021) - [i9]Leora Schmerler, Noam Hazon:
Strategic Voting in the Context of Negotiating Teams. CoRR abs/2107.14097 (2021) - 2020
- [j12]Noam Hazon
Probabilistic physical search on general graphs: approximations and heuristics. Auton. Agents Multi Agent Syst. 34(1): 1 (2020) - [j11]Chaya Levinger
Human satisfaction as the ultimate goal in ridesharing. Future Gener. Comput. Syst. 112: 176-184 (2020) - [c29]Sarit Kraus, Amos Azaria, Jelena Fiosina, Maike Greve, Noam Hazon
AI for Explaining Decisions in Multi-Agent Environments. AAAI 2020: 13534-13538 - [c28]Yael Sabato, Amos Azaria, Noam Hazon:
Viral vs. Effective: Utility Based Influence Maximization. AAMAS 2020: 1169-1177 - [c27]Chaya Levinger, Noam Hazon, Amos Azaria:
Computing the Shapley Value for Ride-Sharing and Routing Games. AAMAS 2020: 1895-1897 - [c26]Noam Hazon, Mira Gonen:
Probabilistic Physical Search on General Graphs: Approximations and Heuristics. AAMAS 2020: 2143-2145 - [c25]Sören Schleibaum, Maike Greve, Tim-Benjamin Lembcke, Amos Azaria, Jelena Fiosina, Noam Hazon, Lutz M. Kolbe, Sarit Kraus, Jörg P. Müller, Mark Vollrath:
How Did You Like This Ride? An Analysis of User Preferences in Ridesharing Assignments. VEHITS 2020: 157-168 - [i8]Naftali Waxman, Sarit Kraus, Noam Hazon:
On Maximizing Egalitarian Value in K-coalitional Hedonic Games. CoRR abs/2001.10772 (2020)
2010 – 2019
- 2019
- [j10]Orgad Keller, Avinatan Hassidim, Noam Hazon
New Approximations for Coalitional Manipulation in Scoring Rules. J. Artif. Intell. Res. 64: 109-145 (2019) - [j9]Orgad Keller, Avinatan Hassidim, Noam Hazon
Approximating Weighted and Priced Bribery in Scoring Rules. J. Artif. Intell. Res. 66: 1057-1098 (2019) - [c24]Anisse Ismaili, Noam Hazon, Emi Watanabe, Makoto Yokoo, Sarit Kraus:
Complexity and Approximations in Robust Coalition Formation via Max-Min k-Partitioning. AAMAS 2019: 2036-2038 - [i7]Chaya Levinger, Noam Hazon, Amos Azaria:
Fair Sharing: The Shapley Value for Ride-Sharing and Routing Games. CoRR abs/1909.04713 (2019) - [i6]Sarit Kraus, Amos Azaria, Jelena Fiosina, Maike Greve, Noam Hazon, Lutz M. Kolbe, Tim-Benjamin Lembcke, Jörg P. Müller, Sören Schleibaum, Mark Vollrath:
AI for Explaining Decisions in Multi-Agent Environments. CoRR abs/1910.04404 (2019) - 2018
- [j8]Yue Yin, Yevgeniy Vorobeychik, Bo An, Noam Hazon
Optimal defense against election control by deleting voter groups. Artif. Intell. 259: 32-51 (2018) - [j7]Liat Sless, Noam Hazon
Forming k coalitions and facilitating relationships in social networks. Artif. Intell. 259: 217-245 (2018) - [c23]Orgad Keller, Avinatan Hassidim, Noam Hazon:
Approximating Bribery in Scoring Rules. AAAI 2018: 1121-1129 - [c22]Sefi Erlich, Noam Hazon
Negotiation Strategies for Agents with Ordinal Preferences. IJCAI 2018: 210-218 - [i5]Sefi Erlich, Noam Hazon, Sarit Kraus:
Negotiation Strategies for Agents with Ordinal Preferences. CoRR abs/1805.00913 (2018) - [i4]Chaya Levinger, Amos Azaria, Noam Hazon:
Human Satisfaction as the Ultimate Goal in Ridesharing. CoRR abs/1807.00376 (2018) - 2017
- [j6]Chen Hajaj
Enhancing comparison shopping agents through ordering and gradual information disclosure. Auton. Agents Multi Agent Syst. 31(3): 696-714 (2017) - [c21]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximation for Borda Coalitional Manipulation. AAMAS 2017: 606-614 - [i3]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximations for Coalitional Manipulation in General Scoring Rules. CoRR abs/1708.04862 (2017) - 2016
- [c20]Yue Yin, Yevgeniy Vorobeychik, Bo An, Noam Hazon:
Optimally Protecting Elections. IJCAI 2016: 538-545 - [i2]Chen Hajaj, Noam Hazon, David Sarne:
Improving Comparison Shopping Agents' Competence through Selective Price Disclosure. CoRR abs/1610.00327 (2016) - 2015
- [j5]Chen Hajaj
Improving comparison shopping agents' competence through selective price disclosure. Electron. Commer. Res. Appl. 14(6): 563-581 (2015) - [c19]Sigal Sina, Noam Hazon, Avinatan Hassidim, Sarit Kraus:
Adapting the Social Network to Affect Elections. AAMAS 2015: 705-713 - [i1]Noam Hazon, Mira Gonen, Max Kleb:
Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs. CoRR abs/1509.08088 (2015) - 2014
- [c18]Chen Hajaj, Noam Hazon, David Sarne:
Ordering Effects and Belief Adjustment in the Use of Comparison Shopping Agents. AAAI 2014: 930-936 - [c17]Liat Sless, Noam Hazon, Sarit Kraus, Michael J. Wooldridge:
Forming coalitions and facilitating relationships for completing tasks in social networks. AAMAS 2014: 261-268 - [c16]Samuel Barrett, Noa Agmon, Noam Hazon, Sarit Kraus, Peter Stone:
Communicating with unknown teammates. AAMAS 2014: 1433-1434 - [c15]Samuel Barrett, Noa Agmon, Noam Hazon
Communicating with Unknown Teammates. ECAI 2014: 45-50 - 2013
- [j4]Noam Hazon
Physical search problems with probabilistic knowledge. Artif. Intell. 196: 26-52 (2013) - [c14]Chen Hajaj, Noam Hazon, David Sarne, Avshalom Elmalech:
Search More, Disclose Less. AAAI 2013: 401-408 - [c13]Noam Hazon, Raz Lin, Sarit Kraus:
How to Change a Group's Collective Decision? IJCAI 2013: 198-205 - 2012
- [j3]Noam Hazon
On the evaluation of election outcomes under uncertainty. Artif. Intell. 189: 1-18 (2012) - [c12]Steven Okamoto, Noam Hazon, Katia P. Sycara:
Solving non-zero sum multiagent network flow security games with attack costs. AAMAS 2012: 879-888 - 2011
- [c11]Svetlana Obraztsova, Edith Elkind, Noam Hazon:
Ties matter: complexity of voting manipulation revisited. AAMAS 2011: 71-78 - [c10]Svetlana Obraztsova, Edith Elkind, Noam Hazon
Ties Matter: Complexity of Voting Manipulation Revisited. IJCAI 2011: 2698-2703 - [c9]Noam Hazon
Game Theoretic Modeling and Computational Analysis of N-Player Conflicts over Resources. SocialCom/PASSAT 2011: 380-387 - 2010
- [c8]Noam Hazon
Complexity of Safe Strategic Voting. SAGT 2010: 210-221
2000 – 2009
- 2009
- [c7]Noam Hazon, Yonatan Aumann, Sarit Kraus:
Collaborative Multi Agent Physical Search with Probabilistic Knowledge. IJCAI 2009: 167-174 - 2008
- [j2]Noa Agmon, Noam Hazon
The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann. Math. Artif. Intell. 52(2-4): 143-168 (2008) - [j1]Noam Hazon
On redundancy, efficiency, and robustness in coverage for multiple robots. Robotics Auton. Syst. 56(12): 1102-1114 (2008) - [c6]Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne:
Physical Search Problems Applying Economic Search Models. AAAI 2008: 9-16 - [c5]Noam Hazon:
Social Interaction under Uncertainty in Multi Agent Systems. AAAI 2008: 1851-1852 - [c4]Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge:
Evaluation of election outcomes under uncertainty. AAMAS (2) 2008: 959-966 - 2006
- [c3]Noa Agmon, Noam Hazon
Constructing Spanning Trees for Efficient Multi-robot Coverage. ICRA 2006: 1698-1703 - [c2]Noam Hazon
Towards Robust on-line Multi-robot Coverage. ICRA 2006: 1710-1715 - 2005
- [c1]Noam Hazon
Redundancy, Efficiency and Robustness in Multi-Robot Coverage. ICRA 2005: 735-741
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: