Author image not provided
 Yair Zick

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.08
Citation Count54
Publication count26
Publication years2011-2017
Available for download9
Average downloads per article89.33
Downloads (cumulative)804
Downloads (12 Months)242
Downloads (6 Weeks)47
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


26 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 26
Result page: 1 2

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

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 ...

3
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 ...

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

Coalitional stability in hedonic games has usually been considered in the setting where agent preferences are fully known. We consider the setting where agent preferences are unknown; we lay the theoretical foundations for studying the interplay between coalitional stability and (PAC) learning in hedonic games. We introduce the notion of ...

5 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

6
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

Large scale smuggling of illegal goods is a long-standing problem, with $1.4 b and thousands of agents assigned to protect the borders from such activity in the US-Mexico border alone. Illegal smuggling activities are usually blocked via inspection stations or ad-hoc checkpoints/roadblocks. Security resources are insufficient to man all stations ...

7
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 2

Voting systems in which voters are partitioned to districts encourage accountability by providing voters an easily identifiable district representative, but can result in a selection of representatives not representative of the electorate's preferences. In some cases, a party may have a majority of the popular vote, but lose the elections ...

8
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Weighted voting games model decision-making bodies where decisions are made by a majority vote. In such games, each agent has a weight, and a coalition of agents wins the game if the sum of the weights of its members exceeds a certain quota. The Shapley value is used as an ...

9
May 2016 AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Downloads (Overall): 11

Full text available: PDFPDF
Efficient tracking of class performance across topics is an important aspect of classroom teaching; this is especially true for psychometric general intelligence exams, which test a varied range of abilities. We develop a framework that uncovers a hidden thematic structure underlying student responses to a large pool of questions, using ...
Keywords: bayesian pca, education, probabilistic graphical models

10
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

In Massively Open Online Courses (MOOCs) TA resources are limited; most MOOCs use peer assessments to grade assignments. Students have to divide up their time between working on their own homework and grading others. If there is no risk of being caught and penalized, students have no reason to spend ...

11
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We consider revenue negotiation problems in iterative settings. In our model, a group of agents has some initial resources, used in order to generate revenue. Agents must agree on some way of dividing resources, but there's a twist. At every time-step, the revenue shares received at time t are agent ...

12
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

A dataset has been classified by some unknown classifier into two types of points. What were the most important factors in determining the classification outcome? In this work, we employ an axiomatic approach in order to uniquely characterize an influence measure: a function that, given a set of classified points, ...

13
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given m random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the values of unseen coalitions? We study the PAC learnability of several well-known classes of cooperative ...

14
January 2015 AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as error-correcting codes: their goal is to correct errors in the input rankings and recover a ranking that is close to the ground truth. We derive worst-case bounds on the relation between ...

15 published by ACM
November 2014 ACM SIGecom Exchanges: Volume 12 Issue 2, December 2013
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 14

Full text available: PDFPDF
We present a formal framework for handling deviation in settings where players divide resources among multiple projects, forming overlapping coalition structures. Having formed such a coalition structure, players share the revenue generated among themselves. Given a profit division, some players may decide that they are underpaid, and deviate from the ...
Keywords: overlapping coalitions, arbitration functions, stability

16
May 2014 Journal of Artificial Intelligence Research: Volume 50 Issue 1, May 2014
Publisher: AI Access Foundation
Bibliometrics:
Citation Count: 1

Overlapping Coalition Formation (OCF) games, introduced by Chalkiadakis, Elkind, Markakis, Polukarov and Jennings in 2010, are cooperative games where players can simultaneously participate in several coalitions. Capturing the notion of stability in OCF games is a difficult task: deviating players may continue to contribute resources to joint projects with non-deviators, ...

17
August 2013 IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0


18
August 2013 IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

Weighted voting games (WVGs) model decision making bodies such as parliaments and councils. In such settings, it is often important to provide a measure of the influence a player has on the vote. Two highly popular such measures are the Shapley-Shubik power index, and the Banzhaf power index. Given a ...

19
July 2013 AAAI'13: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We study the stability of cooperative games played over an interaction network, in a model that was introduced by My-erson (1977). We show that the cost of stability of such games (i.e., the subsidy required to stabilize the game) can be bounded in terms of natural parameters of their underlying ...

20
May 2013 AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 68

Full text available: PDFPDF
Multi-winner elections model scenarios where voters must select a fixed-size group of candidates based on their individual preferences. In such scenarios, it is often the case that voters are incentivized to manipulate , i.e.~misreport their preferences in order to obtain a better outcome. In this paper, we study the complexity ...
Keywords: multi-winner elections, voting, tie-breaking rules



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