 | 2009 |
|---|
| 38 |       | Ariel D. Procaccia,
Moshe Tennenholtz:
Approximate mechanism design without money.
ACM Conference on Electronic Commerce 2009: 177-186 |
| 37 | | Felix A. Fischer,
Ariel D. Procaccia,
Alex Samorodnitsky:
A new perspective on implementation by voting trees.
ACM Conference on Electronic Commerce 2009: 31-40 |
| 36 | | Reshef Meir,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Strategyproof Classification with Shared Inputs.
IJCAI 2009: 220-225 |
| 35 | | Ariel D. Procaccia:
Thou Shalt Covet Thy Neighbor's Cake.
IJCAI 2009: 239-244 |
| 34 | | Alon Altman,
Ariel D. Procaccia,
Moshe Tennenholtz:
Nonmanipulable Selections from a Tournament.
IJCAI 2009: 27-32 |
| 33 | | Lirong Xia,
Michael Zuckerman,
Ariel D. Procaccia,
Vincent Conitzer,
Jeffrey S. Rosenschein:
Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules.
IJCAI 2009: 348-353 |
| 32 | | Ioannis Caragiannis,
Jason A. Covey,
Michal Feldman,
Christopher M. Homan,
Christos Kaklamanis,
Nikos Karanikolas,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
On the approximability of Dodgson and Young elections.
SODA 2009: 1058-1067 |
| 31 | | Ariel D. Procaccia,
Aviv Zohar,
Yoni Peleg,
Jeffrey S. Rosenschein:
The learnability of voting rules.
Artif. Intell. 173(12-13): 1133-1149 (2009) |
| 30 | | Michael Zuckerman,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Algorithms for the coalitional manipulation problem.
Artif. Intell. 173(2): 392-412 (2009) |
| 29 | | Yoram Bachrach,
Ariel Parnes,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Gossip-based aggregation of trust in decentralized reputation systems.
Autonomous Agents and Multi-Agent Systems 19(2): 153-172 (2009) |
| 28 | | Noga Alon,
Michal Feldman,
Ariel D. Procaccia,
Moshe Tennenholtz:
Strategyproof Approximation Mechanisms for Location on Networks
CoRR abs/0907.2049: (2009) |
| 27 | | Noga Alon,
Felix A. Fischer,
Ariel D. Procaccia,
Moshe Tennenholtz:
Sum of Us: Strategyproof Selection from the Selectors
CoRR abs/0910.4699: (2009) |
| 2008 |
|---|
| 26 |  | Reshef Meir,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions.
AAAI 2008: 126-131 |
| 25 | | Yoram Bachrach,
Evangelos Markakis,
Ariel D. Procaccia,
Jeffrey S. Rosenschein,
Amin Saberi:
Approximating power indices.
AAMAS (2) 2008: 943-950 |
| 24 | | Ariel D. Procaccia,
Aviv Zohar,
Jeffrey S. Rosenschein:
Automated design of scoring rules by learning from examples.
AAMAS (2) 2008: 951-958 |
| 23 | | Reshef Meir,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
A broader picture of the complexity of strategic behavior in multi-winner elections.
AAMAS (2) 2008: 991-998 |
| 22 | | Michael Zuckerman,
Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Algorithms for the coalitional manipulation problem.
SODA 2008: 277-286 |
| 21 | | Ofer Dekel,
Felix A. Fischer,
Ariel D. Procaccia:
Incentive compatible regression learning.
SODA 2008: 884-893 |
| 20 | | Shahar Dobzinski,
Ariel D. Procaccia:
Frequent Manipulability of Elections: The Case of Two Voters.
WINE 2008: 653-664 |
| 19 | | Ariel D. Procaccia:
A note on the query complexity of the Condorcet winner problem.
Inf. Process. Lett. 108(6): 390-393 (2008) |
| 18 | | Reshef Meir,
Ariel D. Procaccia,
Jeffrey S. Rosenschein,
Aviv Zohar:
Complexity of Strategic Behavior in Multi-Winner Elections.
J. Artif. Intell. Res. (JAIR) 33: 149-178 (2008) |
| 2007 |
|---|
| 17 | | Ariel D. Procaccia,
Aviv Zohar,
Yoni Peleg,
Jeffrey S. Rosenschein:
Learning Voting Trees.
AAAI 2007: 110-115 |
| 16 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Average-case tractability of manipulation in voting via the fraction of manipulators.
AAMAS 2007: 105 |
| 15 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
A computational characterization of multiagent games with fallacious rewards.
AAMAS 2007: 190 |
| 14 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein,
Gal A. Kaminka:
On the robustness of preference aggregation in noisy environments.
AAMAS 2007: 66 |
| 13 | | Ofer Dekel,
Felix A. Fischer,
Ariel D. Procaccia:
Incentive Compatible Regression Learning.
Computational Social Systems and the Internet 2007 |
| 12 | | Ariel D. Procaccia,
Yoram Bachrach,
Jeffrey S. Rosenschein:
Gossip-Based Aggregation of Trust in Decentralized Reputation Systems.
IJCAI 2007: 1470-1475 |
| 11 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein,
Aviv Zohar:
Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination.
IJCAI 2007: 1476-1481 |
| 10 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Junta Distributions and the Average-Case Complexity of Manipulating Elections.
J. Artif. Intell. Res. (JAIR) 28: 157-181 (2007) |
| 2006 |
|---|
| 9 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Junta distributions and the average-case complexity of manipulating elections.
AAMAS 2006: 497-504 |
| 8 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
The communication complexity of coalition formation among autonomous agents.
AAMAS 2006: 505-512 |
| 7 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Learning to identify winning coalitions in the PAC model.
AAMAS 2006: 673-675 |
| 6 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
The Distortion of Cardinal Preferences in Voting.
CIA 2006: 317-331 |
| 5 | | Jeffrey S. Rosenschein,
Ariel D. Procaccia:
Voting in Cooperative Information Agent Scenarios: Use and Abuse.
CIA 2006: 33-50 |
| 2005 |
|---|
| 4 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Junta Distributions and the Average-Case Complexity of Manipulating Elections.
EUMAS 2005: 282-291 |
| 3 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
The Communication Complexity of Coalition Formation Among Autonomous Agents.
EUMAS 2005: 292-301 |
| 2 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Learning to Identify Winning Coalitions in the PAC model.
EUMAS 2005: 302-311 |
| 1 | | Ariel D. Procaccia,
Jeffrey S. Rosenschein:
Extensive-Form Argumentation Games.
EUMAS 2005: 312-322 |
