| 2013 | ||
|---|---|---|
| i8 | Jeremiah Blocki, Saranga Komanduri, Ariel D. Procaccia, Or Sheffet: Optimizing Password Composition Policies. CoRR abs/1302.5101 (2013) | |
| i7 | Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha: Audit Games. CoRR abs/1303.0356 (2013) | |
| 2012 | ||
| j20 | Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein: Algorithms for strategyproof classification. Artif. Intell. 186: 123-156 (2012) | |
| j19 | 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. Artif. Intell. 187: 31-51 (2012) | |
| c51 | Craig Boutilier, Ariel D. Procaccia: A Dynamic Rationalization of Distance Rationalizability. AAAI 2012 | |
| c50 | Steven J. Brams, Michal Feldman, John K. Lai, Jamie Morgenstern, Ariel D. Procaccia: On Maxsum Fair Cake Divisions. AAAI 2012 | |
| c49 | John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm: Dynamic Matching via Weighted Myopia with Application to Kidney Exchange. AAAI 2012 | |
| c48 | John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm: Optimizing kidney exchange with transplant chains: theory and reality. AAMAS 2012: 711-718 | |
| c47 | Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet: Optimal social choice functions: a utilitarian view. ACM Conference on Electronic Commerce 2012: 197-214 | |
| c46 | David C. Parkes, Ariel D. Procaccia, Nisarg Shah: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Conference on Electronic Commerce 2012: 808-825 | |
| c45 | Tyler Lu, Pingzhong Tang, Ariel D. Procaccia, Craig Boutilier: Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare. UAI 2012: 543-553 | |
| c44 | Ariel D. Procaccia, Sashank Jakkam Reddi, Nisarg Shah: A Maximum Likelihood Approach For Selecting Sets of Alternatives. UAI 2012: 695-704 | |
| i6 | Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz: A Smooth Transition from Powerlessness to Absolute Power. CoRR abs/1205.2074 (2012) | |
| i5 | Ariel D. Procaccia, Sashank Jakkam Reddi, Nisarg Shah: A Maximum Likelihood Approach For Selecting Sets of Alternatives. CoRR abs/1210.4882 (2012) | |
| i4 | Tyler Lu, Pingzhong Tang, Ariel D. Procaccia, Craig Boutilier: Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare. CoRR abs/1210.4895 (2012) | |
| 2011 | ||
| j18 | Ioannis Caragiannis, Ariel D. Procaccia: Voting almost maximizes social welfare despite limited communication. Artif. Intell. 175(9-10): 1655-1671 (2011) | |
| j17 | Ariel D. Procaccia: Computational social choice: the first four centuries. ACM Crossroads 18(2): 31-34 (2011) | |
| j16 | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky: A new perspective on implementation by voting trees. Random Struct. Algorithms 39(1): 59-82 (2011) | |
| c43 | Yuga J. Cohler, John K. Lai, David C. Parkes, Ariel D. Procaccia: Optimal Envy-Free Cake Cutting. AAAI 2011 | |
| c42 | Yiling Chen, Jerry Kung, David C. Parkes, Ariel D. Procaccia, Haoqi Zhang: Incentive design for adaptive agents. AAMAS 2011: 627-634 | |
| c41 | Ioannis Caragiannis, John K. Lai, Ariel D. Procaccia: Towards More Expressive Cake Cutting. IJCAI 2011: 127-132 | |
| c40 | Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz: Sum of us: strategyproof selection from the selectors. TARK 2011: 101-110 | |
| c39 | Ioannis Caragiannis, Aris Filos-Ratsikas, Ariel D. Procaccia: An Improved 2-Agent Kidney Exchange Mechanism. WINE 2011: 37-48 | |
| 2010 | ||
| j15 | Yoram Bachrach, Evangelos Markakis, Ezra Resnick, Ariel D. Procaccia, Jeffrey S. Rosenschein, Amin Saberi: Approximating power indices: theoretical and empirical analysis. Autonomous Agents and Multi-Agent Systems 20(2): 105-122 (2010) | |
| j14 | Piotr Faliszewski, Ariel D. Procaccia: AI's War on Manipulation: Are We Winning? AI Magazine 31(4): 53-64 (2010) | |
| j13 | Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz: Walking in circles. Discrete Mathematics 310(23): 3432-3435 (2010) | |
| j12 | Bezalel Peleg, Ariel D. Procaccia: Implementation by mediated equilibrium. Int. J. Game Theory 39(1-2): 191-207 (2010) | |
| j11 | Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz: A note on competitive diffusion through social networks. Inf. Process. Lett. 110(6): 221-225 (2010) | |
| j10 | Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia: Incentive compatible regression learning. J. Comput. Syst. Sci. 76(8): 759-777 (2010) | |
| j9 | Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz: Strategyproof Approximation of the Minimax on Networks. Math. Oper. Res. 35(3): 513-526 (2010) | |
| c38 | Ioannis Caragiannis, Ariel D. Procaccia: Voting Almost Maximizes Social Welfare Despite Limited Communication. AAAI 2010 | |
| c37 | Yiling Chen, John K. Lai, David C. Parkes, Ariel D. Procaccia: Truth, Justice, and Cake Cutting. AAAI 2010 | |
| c36 | ||
| c35 | Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the limits of dictatorial classification. AAMAS 2010: 609-616 | |
| c34 | Tyler Moore, Allan Friedman, Ariel D. Procaccia: Would a 'cyber warrior' protect us: exploring trade-offs between attack and defense of information systems. NSPW 2010: 85-94 | |
| c33 | Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia: Socially desirable approximations for Dodgson's voting rule. ACM Conference on Electronic Commerce 2010: 253-262 | |
| c32 | Lirong Xia, Vincent Conitzer, Ariel D. Procaccia: A scheduling approach to coalitional manipulation. ACM Conference on Electronic Commerce 2010: 275-284 | |
| c31 | Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia: Mix and match. ACM Conference on Electronic Commerce 2010: 305-314 | |
| i3 | Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia: Mix and Match. CoRR abs/1006.1881 (2010) | |
| 2009 | ||
| j8 | 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) | |
| j7 | Michael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein: Algorithms for the coalitional manipulation problem. Artif. Intell. 173(2): 392-412 (2009) | |
| j6 | Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffrey S. Rosenschein: The learnability of voting rules. Artif. Intell. 173(12-13): 1133-1149 (2009) | |
| c30 | Alon Altman, Ariel D. Procaccia, Moshe Tennenholtz: Nonmanipulable Selections from a Tournament. IJCAI 2009: 27-32 | |
| c29 | Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein: Strategyproof Classification with Shared Inputs. IJCAI 2009: 220-225 | |
| c28 | ||
| c27 | 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 | |
| c26 | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky: A new perspective on implementation by voting trees. ACM Conference on Electronic Commerce 2009: 31-40 | |
| c25 | Ariel D. Procaccia, Moshe Tennenholtz: Approximate mechanism design without money. ACM Conference on Electronic Commerce 2009: 177-186 | |
| c24 | 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 | |
| i2 | Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz: Strategyproof Approximation Mechanisms for Location on Networks. CoRR abs/0907.2049 (2009) | |
| i1 | Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz: Sum of Us: Strategyproof Selection from the Selectors. CoRR abs/0910.4699 (2009) | |
| 2008 | ||
| j5 | Ariel D. Procaccia: A note on the query complexity of the Condorcet winner problem. Inf. Process. Lett. 108(6): 390-393 (2008) | |
| j4 | 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) | |
| j3 | Ariel D. Procaccia, Jeffrey S. Rosenschein, Aviv Zohar: On the complexity of achieving proportional representation. Social Choice and Welfare 30(3): 353-362 (2008) | |
| j2 | Ariel D. Procaccia: Towards a theory of incentives in machine learning. SIGecom Exchanges 7(2) (2008) | |
| c23 | Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein: Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions. AAAI 2008: 126-131 | |
| c22 | Yoram Bachrach, Evangelos Markakis, Ariel D. Procaccia, Jeffrey S. Rosenschein, Amin Saberi: Approximating power indices. AAMAS (2) 2008: 943-950 | |
| c21 | Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosenschein: Automated design of scoring rules by learning from examples. AAMAS (2) 2008: 951-958 | |
| c20 | 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 | |
| c19 | Michael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein: Algorithms for the coalitional manipulation problem. SODA 2008: 277-286 | |
| c18 | Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia: Incentive compatible regression learning. SODA 2008: 884-893 | |
| c17 | Shahar Dobzinski, Ariel D. Procaccia: Frequent Manipulability of Elections: The Case of Two Voters. WINE 2008: 653-664 | |
| 2007 | ||
| j1 | 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) | |
| c16 | Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffrey S. Rosenschein: Learning Voting Trees. AAAI 2007: 110-115 | |
| c15 | Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A. Kaminka: On the robustness of preference aggregation in noisy environments. AAMAS 2007: 66 | |
| c14 | Ariel D. Procaccia, Jeffrey S. Rosenschein: Average-case tractability of manipulation in voting via the fraction of manipulators. AAMAS 2007: 105 | |
| c13 | Ariel D. Procaccia, Jeffrey S. Rosenschein: A computational characterization of multiagent games with fallacious rewards. AAMAS 2007: 190 | |
| c12 | Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia: Incentive Compatible Regression Learning. Computational Social Systems and the Internet 2007 | |
| c11 | Ariel D. Procaccia, Yoram Bachrach, Jeffrey S. Rosenschein: Gossip-Based Aggregation of Trust in Decentralized Reputation Systems. IJCAI 2007: 1470-1475 | |
| c10 | Ariel D. Procaccia, Jeffrey S. Rosenschein, Aviv Zohar: Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination. IJCAI 2007: 1476-1481 | |
| 2006 | ||
| c9 | Ariel D. Procaccia, Jeffrey S. Rosenschein: Junta distributions and the average-case complexity of manipulating elections. AAMAS 2006: 497-504 | |
| c8 | Ariel D. Procaccia, Jeffrey S. Rosenschein: The communication complexity of coalition formation among autonomous agents. AAMAS 2006: 505-512 | |
| c7 | Ariel D. Procaccia, Jeffrey S. Rosenschein: Learning to identify winning coalitions in the PAC model. AAMAS 2006: 673-675 | |
| c6 | Jeffrey S. Rosenschein, Ariel D. Procaccia: Voting in Cooperative Information Agent Scenarios: Use and Abuse. CIA 2006: 33-50 | |
| c5 | Ariel D. Procaccia, Jeffrey S. Rosenschein: The Distortion of Cardinal Preferences in Voting. CIA 2006: 317-331 | |
| 2005 | ||
| c4 | Ariel D. Procaccia, Jeffrey S. Rosenschein: Junta Distributions and the Average-Case Complexity of Manipulating Elections. EUMAS 2005: 282-291 | |
| c3 | Ariel D. Procaccia, Jeffrey S. Rosenschein: The Communication Complexity of Coalition Formation Among Autonomous Agents. EUMAS 2005: 292-301 | |
| c2 | Ariel D. Procaccia, Jeffrey S. Rosenschein: Learning to Identify Winning Coalitions in the PAC model. EUMAS 2005: 302-311 | |
| c1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page