Moshe Mash
Moshe Mash
moshikmashatgmail.com

  Affiliation history
Bibliometrics: publication history
Average citations per article1.86
Citation Count13
Publication count7
Publication years2012-2017
Available for download4
Average downloads per article89.50
Downloads (cumulative)358
Downloads (12 Months)185
Downloads (6 Weeks)44
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1 published by ACM
November 2017 Journal of the ACM (JACM): Volume 64 Issue 6, November 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 27,   Downloads (12 Months): 55,   Downloads (Overall): 55

Full text available: PDFPDF
“Mirror, mirror, on the wall, who is the fairest of them all?” The Evil Queen What is a fair way to assign rooms to several housemates and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions ...
Keywords: Computational fair division

2
August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

This paper proposes a new negotiation game, based on the weighted voting paradigm in cooperative game theory, where agents need to form coalitions and agree on how to share the gains. Despite the prevalence of weighted voting in the real world, there has been little work studying people's behavior in ...

3
August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

What is a fair way to assign rooms to several housemates, and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions to rent division instances. But envy freeness, in and of itself, is insufficient to guarantee ...

4 published by ACM
July 2016 EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 15,   Downloads (12 Months): 120,   Downloads (Overall): 251

Full text available: PDFPDF
What is a fair way to assign rooms to several housemates, and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions to rent division instances. But envy freeness, in and of itself, is insufficient to guarantee ...
Keywords: computational fair division

5
September 2014 Artificial Intelligence: Volume 214 Issue 1, September 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4

This paper considers the problem of autonomous agents that need to pick one of several options, all plausible however differ in their value, which is a priori uncertain and can be revealed for a cost. The agents thus need to weigh the benefits of revealing further values against the associated ...
Keywords: cooperation, multi-agent economic search, self-interested agents

6
May 2014 AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 5,   Downloads (Overall): 27

Full text available: PDFPDF
In many domains, an autonomous agent needs to reliably predict the distribution of behaviors of a population rather than the behavior of a single agent. For example, when playing the ultimatum game against several unknown opponents from a large known population, the agent can perform better by extracting its best-response ...
Keywords: strategy elicitation, agent-based analysis of human interactions, pdas

7
December 2012 WI-IAT '12: Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 25

Full text available: PDFPDF
This paper considers the problem of self-interested agents engaged in costly exploration when individual findings benefit all agents. The purpose of the exploration is to reason about the nature and value of the different opportunities available to the agents whenever such information is a priori unknown. While the problem has ...
Keywords: Multi-Agent Exploration, Cooperation



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us