Ariel D. Procaccia

According to our database1, Ariel D. Procaccia authored at least 194 papers between 2005 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Fair Enough: Guaranteeing Approximate Maximin Shares.
J. ACM, 2018

Envy-Free Classification.
CoRR, 2018

Migration as Submodular Optimization.
CoRR, 2018

Choosing How to Choose Papers.
CoRR, 2018

The Fluid Mechanics of Liquid Democracy.
CoRR, 2018

Fairly Allocating Many Goods with Few Queries.
CoRR, 2018

A Computational Approach to Organizational Structure.
CoRR, 2018

Strategyproof Linear Regression in High Dimensions.
CoRR, 2018

Which is the fairest (rent division) of them all?
Commun. ACM, 2018

Strategyproof Linear Regression in High Dimensions.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

How to Make Envy Vanish Over Time.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

The Provable Virtue of Laziness in Motion Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Approximation-Variance Tradeoffs in Facility Location Games.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Fair Rent Division on a Budget.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

A Voting-Based System for Ethical Decision Making.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Liquid Democracy: An Algorithmic Perspective.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Ranking Wily People Who Rank Each Other.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Weighted Voting Via No-Regret Learning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Monitoring stealthy diffusion.
Knowl. Inf. Syst., 2017

Subset Selection Via Implicit Utilitarian Voting.
J. Artif. Intell. Res., 2017

Which Is the Fairest (Rent Division) of Them All?
J. ACM, 2017

A partisan districting protocol with provably nonpartisan outcomes.
CoRR, 2017

The Provable Virtue of Laziness in Motion Planning.
CoRR, 2017

A Voting-Based System for Ethical Decision Making.
CoRR, 2017

Why You Should Charge Your Friends for Borrowing Your Stuff.
CoRR, 2017

Game-Theoretic Modeling of Human Adaptation in Human-Robot Collaboration.
CoRR, 2017

Weighted Voting Via No-Regret Learning.
CoRR, 2017

Opting Into Optimal Matchings.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Lower Bound for Equitable Cake Cutting.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Making Right Decisions Based on Wrong Opinions.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Collaborative PAC Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Why You Should Charge Your Friends for Borrowing Your Stuff.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Which is the Fairest (Rent Division) of Them All? [Extended Abstract].
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Game-Theoretic Modeling of Human Adaptation in Human-Robot Collaboration.
Proceedings of the 2017 ACM/IEEE International Conference on Human-Robot Interaction, 2017

Multi-Channel Marketing with Budget Complementarities.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Small Representations of Big Kidney Exchange Graphs.
Proceedings of the AI and OR for Social Good, Papers from the 2017 AAAI Workshop, 2017

Small Representations of Big Kidney Exchange Graphs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Preference Elicitation For Participatory Budgeting.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Cake Cutting Algorithms.
Proceedings of the Handbook of Computational Social Choice, 2016

Introduction to Computational Social Choice.
Proceedings of the Handbook of Computational Social Choice, 2016

When Do Noisy Votes Reveal the Truth?
ACM Trans. Economics and Comput., 2016

Fair Division (Dagstuhl Seminar 16232).
Dagstuhl Reports, 2016

Small Representations of Big Kidney Exchange Graphs.
CoRR, 2016

Opting Into Optimal Matchings.
CoRR, 2016

Voting rules as error-correcting codes.
Artif. Intell., 2016

Which Is the Fairest (Rent Division) of Them All?
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Unreasonable Fairness of Maximum Nash Welfare.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Three Strategies to Success: Learning Adversary Models in Security Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Subset Selection via Implicit Utilitarian Voting.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Truthful Univariate Estimators.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Optimal Aggregation of Uncertain Preferences.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

When Can the Maximin Share Guarantee Be Guaranteed?
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

An Algorithmic Framework for Strategic Fair Division.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Beyond Dominant Resource Fairness: Extensions, Limitations, and Indivisibilities.
ACM Trans. Economics and Comput., 2015

An improved 2-agent kidney exchange mechanism.
Theor. Comput. Sci., 2015

Mix and match: A strategyproof mechanism for multi-hospital kidney exchange.
Games and Economic Behavior, 2015

Influence in Classification via Cooperative Game Theory.
CoRR, 2015

Learning Cooperative Games.
CoRR, 2015

Optimal social choice functions: A utilitarian view.
Artif. Intell., 2015

Leximin Allocations in the Real World.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Commitment Without Regrets: Online Learning in Stackelberg Security Games.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Is Approval Voting Optimal Given Approval Votes?
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Variational Dropout and the Local Reparameterization Trick.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Verifiably Truthful Mechanisms.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Ranked Voting on Social Networks.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Impartial Peer Review.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Influence in Classification via Cooperative Game Theory.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Learning Cooperative Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Monitoring Stealthy Diffusion.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

Dynamic Influence Maximization Under Increasing Returns to Scale.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Voting Rules As Error-Correcting Codes.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Audit Games with Multiple Defender Resources.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Socially desirable approximations for dodgson's voting rule.
ACM Trans. Algorithms, 2014

Editor's introduction.
SIGecom Exchanges, 2014

Spliddit: unleashing fair division algorithms.
SIGecom Exchanges, 2014

No Agent Left Behind: Dynamic Fair Division of Multiple Resources.
J. Artif. Intell. Res., 2014

Verifiably Truthful Mechanisms.
CoRR, 2014

Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries.
CoRR, 2014

Audit Games with Multiple Defender Resources.
CoRR, 2014

Fair enough: guaranteeing approximate maximin shares.
Proceedings of the ACM Conference on Economics and Computation, 2014

Diverse Randomized Agents Vote to Win.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Learning Optimal Commitment to Overcome Insecurity.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Price of fairness in kidney exchange.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

On the Structure of Synergies in Cooperative Games.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Envy-Free Division of Sellable Goods.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

The Computational Rise and Fall of Fairness.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Modal Ranking: A Uniquely Robust Voting Rule.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Biased Games.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Lazy Defenders Are Almost Optimal against Diligent Attackers.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Simultaneous Cake Cutting.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Approximate Mechanism Design without Money.
ACM Trans. Economics and Comput., 2013

Editor's introduction.
SIGecom Exchanges, 2013

Editor's introduction.
SIGecom Exchanges, 2013

A Smooth Transition from Powerlessness to Absolute Power.
J. Artif. Intell. Res., 2013

Truth, justice, and cake cutting.
Games and Economic Behavior, 2013

Audit Games
CoRR, 2013

Optimizing Password Composition Policies
CoRR, 2013

Equilibria of Generalized Cut and Choose Protocols.
CoRR, 2013

Cake cutting: not just child's play.
Commun. ACM, 2013

Failure-aware kidney exchange.
Proceedings of the ACM Conference on Electronic Commerce, 2013

When do noisy votes reveal the truth?
Proceedings of the ACM Conference on Electronic Commerce, 2013

Harnessing the power of two crossmatches.
Proceedings of the ACM Conference on Electronic Commerce, 2013

Optimizing password composition policies.
Proceedings of the ACM Conference on Electronic Commerce, 2013

Defender (Mis)coordination in Security Games.
Proceedings of the IJCAI 2013, 2013

Externalities in Cake Cutting.
Proceedings of the IJCAI 2013, 2013

Audit Games.
Proceedings of the IJCAI 2013, 2013

Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers.
Proceedings of the Decision and Game Theory for Security - 4th International Conference, 2013

No agent left behind: dynamic fair division of multiple resources.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Dynamic Social Choice with Evolving Preferences.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Better Human Computation Through Principled Voting.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

How to Cut a Cake Before the Party Ends.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

How Bad Is Selfish Voting?
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Editor's introduction.
SIGecom Exchanges, 2012

Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare
CoRR, 2012

A Maximum Likelihood Approach For Selecting Sets of Alternatives
CoRR, 2012

A Smooth Transition from Powerlessness to Absolute Power
CoRR, 2012

Algorithms for strategyproof classification.
Artif. Intell., 2012

On the approximability of Dodgson and Young elections.
Artif. Intell., 2012

A Maximum Likelihood Approach For Selecting Sets of Alternatives.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Beyond dominant resource fairness: extensions, limitations, and indivisibilities.
Proceedings of the ACM Conference on Electronic Commerce, 2012

Optimal social choice functions: a utilitarian view.
Proceedings of the ACM Conference on Electronic Commerce, 2012

Social Choice for Human Computation.
Proceedings of the 4th Human Computation Workshop, 2012

TurkServer: Enabling Synchronous and Longitudinal Online Experiments.
Proceedings of the 4th Human Computation Workshop, 2012

Optimizing kidney exchange with transplant chains: theory and reality.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Dynamic Matching via Weighted Myopia with Application to Kidney Exchange.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

On Maxsum Fair Cake Divisions.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

A Dynamic Rationalization of Distance Rationalizability.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A new perspective on implementation by voting trees.
Random Struct. Algorithms, 2011

Computational social choice: the first four centuries.
ACM Crossroads, 2011

Voting almost maximizes social welfare despite limited communication.
Artif. Intell., 2011

An Improved 2-Agent Kidney Exchange Mechanism.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Sum of us: strategyproof selection from the selectors.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Towards More Expressive Cake Cutting.
Proceedings of the IJCAI 2011, 2011

Incentive design for adaptive agents.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Optimal Envy-Free Cake Cutting.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Strategyproof Approximation of the Minimax on Networks.
Math. Oper. Res., 2010

Incentive compatible regression learning.
J. Comput. Syst. Sci., 2010

A note on competitive diffusion through social networks.
Inf. Process. Lett., 2010

Implementation by mediated equilibrium.
Int. J. Game Theory, 2010

Walking in circles.
Discrete Mathematics, 2010

Mix and Match
CoRR, 2010

AI's War on Manipulation: Are We Winning?
AI Magazine, 2010

Approximating power indices: theoretical and empirical analysis.
Autonomous Agents and Multi-Agent Systems, 2010

A scheduling approach to coalitional manipulation.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Socially desirable approximations for Dodgson's voting rule.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Mix and match.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Would a 'cyber warrior' protect us: exploring trade-offs between attack and defense of information systems.
Proceedings of the 2010 Workshop on New Security Paradigms, 2010

Nonmanipulable Selections from a Tournament.
Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010

On the limits of dictatorial classification.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Can Approximation Circumvent Gibbard-Satterthwaite?
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Truth, Justice, and Cake Cutting.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Voting Almost Maximizes Social Welfare Despite Limited Communication.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Sum of Us: Strategyproof Selection from the Selectors
CoRR, 2009

Strategyproof Approximation Mechanisms for Location on Networks
CoRR, 2009

Algorithms for the coalitional manipulation problem.
Artif. Intell., 2009

The learnability of voting rules.
Artif. Intell., 2009

Gossip-based aggregation of trust in decentralized reputation systems.
Autonomous Agents and Multi-Agent Systems, 2009

On the approximability of Dodgson and Young elections.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximate mechanism design without money.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

A new perspective on implementation by voting trees.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules.
Proceedings of the IJCAI 2009, 2009

Thou Shalt Covet Thy Neighbor's Cake.
Proceedings of the IJCAI 2009, 2009

Strategyproof Classification with Shared Inputs.
Proceedings of the IJCAI 2009, 2009

Nonmanipulable Selections from a Tournament.
Proceedings of the IJCAI 2009, 2009

2008
Towards a theory of incentives in machine learning.
SIGecom Exchanges, 2008

On the complexity of achieving proportional representation.
Social Choice and Welfare, 2008

Complexity of Strategic Behavior in Multi-Winner Elections.
J. Artif. Intell. Res., 2008

A note on the query complexity of the Condorcet winner problem.
Inf. Process. Lett., 2008

Frequent Manipulability of Elections: The Case of Two Voters.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Algorithms for the coalitional manipulation problem.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Incentive compatible regression learning.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Automated design of scoring rules by learning from examples.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

A broader picture of the complexity of strategic behavior in multi-winner elections.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Approximating power indices.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Junta Distributions and the Average-Case Complexity of Manipulating Elections.
J. Artif. Intell. Res., 2007

Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination.
Proceedings of the IJCAI 2007, 2007

Gossip-Based Aggregation of Trust in Decentralized Reputation Systems.
Proceedings of the IJCAI 2007, 2007

Incentive Compatible Regression Learning.
Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

On the robustness of preference aggregation in noisy environments.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

A computational characterization of multiagent games with fallacious rewards.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Average-case tractability of manipulation in voting via the fraction of manipulators.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Learning Voting Trees.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Voting in Cooperative Information Agent Scenarios: Use and Abuse.
Proceedings of the Cooperative Information Agents X, 10th International Workshop, 2006

The Distortion of Cardinal Preferences in Voting.
Proceedings of the Cooperative Information Agents X, 10th International Workshop, 2006

Learning to identify winning coalitions in the PAC model.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

The communication complexity of coalition formation among autonomous agents.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Junta distributions and the average-case complexity of manipulating elections.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

2005
Extensive-Form Argumentation Games.
Proceedings of the EUMAS 2005, 2005

Learning to Identify Winning Coalitions in the PAC model.
Proceedings of the EUMAS 2005, 2005

The Communication Complexity of Coalition Formation Among Autonomous Agents.
Proceedings of the EUMAS 2005, 2005

Junta Distributions and the Average-Case Complexity of Manipulating Elections.
Proceedings of the EUMAS 2005, 2005


  Loading...