Ariel D. Procaccia

SIGecom Exch., 2024

Fair and Efficient Online Allocations.

[BibT_eX]

[DOI]

Gerdus Benadè

Christos-Alexandros Psomas

David Zeng

Oper. Res., 2024

Strategic Classification With Externalities.

[BibT_eX]

[DOI]

CoRR, 2024

Honor Among Bandits: No-Regret Learning for Online Fair Division.

[BibT_eX]

[DOI]

Benjamin Schiffer

Shirley Zhang

CoRR, 2024

Federated Assemblies.

[BibT_eX]

[DOI]

CoRR, 2024

Learning Social Welfare Functions.

[BibT_eX]

[DOI]

Kanad Shrikar Pardeshi

Itai Shapira

Aarti Singh

CoRR, 2024

Bias Detection Via Signaling.

[BibT_eX]

[DOI]

CoRR, 2024

Axioms for AI Alignment from Human Feedback.

[BibT_eX]

[DOI]

CoRR, 2024

Multi-Apartment Rent Division.

[BibT_eX]

[DOI]

Ben Schiffer

Shirley Zhang

CoRR, 2024

Optimal Engagement-Diversity Tradeoffs in Social Media.

[BibT_eX]

[DOI]

Proceedings of the ACM on Web Conference 2024, 2024

School Redistricting: Wiping Unfairness Off the Map.

[BibT_eX]

[DOI]

Isaac Robinson

Jamie Tucker-Foltz

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Generative Social Choice.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Fair Federated Learning via the Proportional Veto Core.

[BibT_eX]

[DOI]

Bhaskar Ray Chaudhury

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Learning Decision-Making Functions Given Cardinal and Ordinal Consensus Data.

[BibT_eX]

[DOI]

Proceedings of the AAAI 2024 Spring Symposium Series, 2024

Manipulation-Robust Selection of Citizens' Assemblies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Distortion Under Public-Spirited Voting.

[BibT_eX]

[DOI]

Bailey Flanigan

Sven Wang

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

You Can Have Your Cake and Redistrict It Too.

[BibT_eX]

[DOI]

Gerdus Benade

Jamie Tucker-Foltz

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

In Defense of Liquid Democracy.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Distortion of Binomial Voting Defies Expectation.

[BibT_eX]

[DOI]

Yannai A. Gonczarowski

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Strategyproof Voting under Correlated Beliefs.

[BibT_eX]

[DOI]

Daniel Halpern

Rachel Li

Francisco J. Marmolejo Cossío

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Now We're Talking: Better Deliberation Groups through Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Representation with Incomplete Votes.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The phantom steering effect in Q&A websites.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2022

Welfare-Maximizing Pooled Testing.

[BibT_eX]

[DOI]

Edwin Lock

Evi Micha

CoRR, 2022

Compact Redistricting Plans Have Many Spanning Trees.

[BibT_eX]

[DOI]

Jamie Tucker-Foltz

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

In This Apportionment Lottery, the House Always Wins.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Fair Allocations for Smoothed Utilities.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Robust Rent Division.

[BibT_eX]

[DOI]

David Zhu

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Recruitment Strategies That Take a Chance.

[BibT_eX]

[DOI]

Gregory Kehne

Jingyan Wang

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Is Sortition Both Representative and Fair?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

The Fluid Mechanics of Liquid Democracy.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Fairly Allocating Many Goods with Few Queries.

[BibT_eX]

[DOI]

Hoon Oh

Warut Suksompong

SIAM J. Discret. Math., 2021

Belief polarization in a complex world: A learning theory perspective.

[BibT_eX]

[DOI]

Matthew O. Jackson

Proc. Natl. Acad. Sci. USA, 2021

Fair algorithms for selecting citizens' assemblies.

[BibT_eX]

[DOI]

Nat., 2021

Preference Elicitation for Participatory Budgeting.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Loss Functions, Axioms, and Peer Review.

[BibT_eX]

[DOI]

Nihar B. Shah

J. Artif. Intell. Res., 2021

Liquid Democracy: An Algorithmic Perspective.

[BibT_eX]

[DOI]

Simon Mackenzie

J. Artif. Intell. Res., 2021

In Defense of Fluid Democracy.

[BibT_eX]

[DOI]

CoRR, 2021

Fair Sortition Made Transparent.

[BibT_eX]

[DOI]

Bailey Flanigan

Gregory Kehne

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

If You Like Shapley Then You'll Love the Core.

[BibT_eX]

[DOI]

Tom Yan

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Preference Elicitation as Average-Case Sorting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Inverse Reinforcement Learning From Like-Minded Teachers.

[BibT_eX]

[DOI]

Tom Yan

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

District-Fair Participatory Budgeting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Aggregating Binary Judgments Ranked by Accuracy.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries.

[BibT_eX]

[DOI]

Oper. Res., 2020

The Goal-Gradient Hypothesis in Stack Overflow.

[BibT_eX]

[DOI]

CoRR, 2020

An answer to fair division's most enigmatic question: technical perspective.

[BibT_eX]

[DOI]

Commun. ACM, 2020

Fair Division with Binary Valuations: One Rule to Rule Them All.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Explainable Voting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Axioms for Learning from Pairwise Comparisons.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Neutralizing Self-Selection Bias in Sampling for Sortition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Computation-Aware Data Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Strategyproof Mean Estimation from Multiple-Choice Questions.

[BibT_eX]

[DOI]

Gregory Kehne

Proceedings of the 37th International Conference on Machine Learning, 2020

Learning and Planning in the Feature Deception Problem.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - 11th International Conference, 2020

HirePeer: Impartial Peer-Assessed Hiring at Scale in Expert Crowdsourcing Markets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Multiagent Evaluation Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

The Unreasonable Fairness of Maximum Nash Welfare.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

WeBuildAI: Participatory Framework for Algorithmic Governance.

[BibT_eX]

[DOI]

Proc. ACM Hum. Comput. Interact., 2019

Failure-Aware Kidney Exchange.

[BibT_eX]

[DOI]

Manag. Sci., 2019

Learning and Planning in Feature Deception Games.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient and Thrifty Voting by Any Means Necessary.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Paradoxes in Fair Machine Learning.

[BibT_eX]

[DOI]

Christos-Alexandros Psomas

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Envy-Free Classification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Achieving a Fairer Future by Changing the Past.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The Provable Virtue of Laziness in Motion Planning.

[BibT_eX]

[DOI]

Siddhartha S. Srinivasa

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Statistical Foundations of Virtual Democracy.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

No Stratification Without Representation.

[BibT_eX]

[DOI]

Gerdus Benadè

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Migration as Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Low-Distortion Social Welfare Functions.

[BibT_eX]

[DOI]

Gerdus Benadè

Mingda Qiao

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Leximin Allocations in the Real World.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2018

Strategyproof linear regression in high dimensions: an overview.

[BibT_eX]

[DOI]

SIGecom Exch., 2018

Fair Enough: Guaranteeing Approximate Maximin Shares.

[BibT_eX]

[DOI]

J. ACM, 2018

Choosing How to Choose Papers.

[BibT_eX]

[DOI]

Nihar B. Shah

CoRR, 2018

A Computational Approach to Organizational Structure.

[BibT_eX]

[DOI]

CoRR, 2018

Which is the fairest (rent division) of them all?

[BibT_eX]

[DOI]

Commun. ACM, 2018

Strategyproof Linear Regression in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

How to Make Envy Vanish Over Time.

[BibT_eX]

[DOI]

Gerdus Benade

Christos-Alexandros Psomas

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Approximation-Variance Tradeoffs in Facility Location Games.

[BibT_eX]

[DOI]

David Wajc

Hanrui Zhang

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Fair Rent Division on a Budget.

[BibT_eX]

[DOI]

Rodrigo A. Velez

Dingli Yu

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

A Voting-Based System for Ethical Decision Making.

[BibT_eX]

[DOI]

Snehalkumar (Neil) S. Gaikwad

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Ranking Wily People Who Rank Each Other.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Weighted Voting Via No-Regret Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Monitoring stealthy diffusion.

[BibT_eX]

[DOI]

Xenofon D. Koutsoukos

Knowl. Inf. Syst., 2017

Subset Selection Via Implicit Utilitarian Voting.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

A partisan districting protocol with provably nonpartisan outcomes.

[BibT_eX]

[DOI]

Wesley Pegden

Dingli Yu

CoRR, 2017

Opting Into Optimal Matchings.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Lower Bound for Equitable Cake Cutting.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Making Right Decisions Based on Wrong Opinions.

[BibT_eX]

[DOI]

Gerdus Benade

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Collaborative PAC Learning.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Which is the Fairest (Rent Division) of Them All? [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Game-Theoretic Modeling of Human Adaptation in Human-Robot Collaboration.

[BibT_eX]

[DOI]

Stefanos Nikolaidis

Swaprava Nath

Siddhartha S. Srinivasa

Proceedings of the 2017 ACM/IEEE International Conference on Human-Robot Interaction, 2017

Multi-Channel Marketing with Budget Complementarities.

[BibT_eX]

[DOI]

Haifeng Zhang

Yevgeniy Vorobeychik

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Small Representations of Big Kidney Exchange Graphs.

[BibT_eX]

[DOI]

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Cake Cutting Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Social Choice, 2016

Introduction to Computational Social Choice.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Social Choice, 2016

When Do Noisy Votes Reveal the Truth?

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Fair Division (Dagstuhl Seminar 16232).

[BibT_eX]

[DOI]

Yonatan Aumann

Jérôme Lang

Dagstuhl Reports, 2016

Voting rules as error-correcting codes.

[BibT_eX]

[DOI]

Yair Zick

Artif. Intell., 2016

Three Strategies to Success: Learning Adversary Models in Security Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Truthful Univariate Estimators.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

Optimal Aggregation of Uncertain Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

When Can the Maximin Share Guarantee Be Guaranteed?

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

An Algorithmic Framework for Strategic Fair Division.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Beyond Dominant Resource Fairness: Extensions, Limitations, and Indivisibilities.

[BibT_eX]

[DOI]

David C. Parkes

ACM Trans. Economics and Comput., 2015

An improved 2-agent kidney exchange mechanism.

[BibT_eX]

[DOI]

Aris Filos-Ratsikas

Theor. Comput. Sci., 2015

Mix and match: A strategyproof mechanism for multi-hospital kidney exchange.

[BibT_eX]

[DOI]

Games Econ. Behav., 2015

Optimal social choice functions: A utilitarian view.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Commitment Without Regrets: Online Learning in Stackelberg Security Games.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Is Approval Voting Optimal Given Approval Votes?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Verifiably Truthful Mechanisms.

[BibT_eX]

[DOI]

Simina Brânzei

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Ranked Voting on Social Networks.

[BibT_eX]

[DOI]

Eric Sodomka

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Impartial Peer Review.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Influence in Classification via Cooperative Game Theory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Learning Cooperative Games.

[BibT_eX]

[DOI]

Maria-Florina Balcan

Yair Zick

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Dynamic Influence Maximization Under Increasing Returns to Scale.

[BibT_eX]

[DOI]

Haifeng Zhang

Yevgeniy Vorobeychik

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Audit Games with Multiple Defender Resources.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Socially desirable approximations for dodgson's voting rule.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Spliddit: unleashing fair division algorithms.

[BibT_eX]

[DOI]

Jonathan R. Goldman

SIGecom Exch., 2014

No Agent Left Behind: Dynamic Fair Division of Multiple Resources.

[BibT_eX]

[DOI]

Ian A. Kash

J. Artif. Intell. Res., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Fair enough: guaranteeing approximate maximin shares.

[BibT_eX]

[DOI]

Leandro Soriano Marcolino

Proceedings of the ACM Conference on Economics and Computation, 2014

Diverse Randomized Agents Vote to Win.

[BibT_eX]

[DOI]

Albert Xin Jiang

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.

[BibT_eX]

[DOI]

Avrim Blum

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.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

On the Structure of Synergies in Cooperative Games.

[BibT_eX]

[DOI]

Max Lee Tucker

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

Envy-Free Division of Sellable Goods.

[BibT_eX]

[DOI]

Jeremy Karp

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

The Computational Rise and Fall of Fairness.

[BibT_eX]

[DOI]

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

Modal Ranking: A Uniquely Robust Voting Rule.

[BibT_eX]

[DOI]

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

Biased Games.

[BibT_eX]

[DOI]

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

Lazy Defenders Are Almost Optimal against Diligent Attackers.

[BibT_eX]

[DOI]

Avrim Blum

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

Simultaneous Cake Cutting.

[BibT_eX]

[DOI]

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

2013

Approximate Mechanism Design without Money.

[BibT_eX]

[DOI]

Moshe Tennenholtz

ACM Trans. Economics and Comput., 2013

Editor's introduction.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

A Smooth Transition from Powerlessness to Absolute Power.

[BibT_eX]

[DOI]

Elchanan Mossel

Miklós Z. Rácz

J. Artif. Intell. Res., 2013

Truth, justice, and cake cutting.

[BibT_eX]

[DOI]

Games Econ. Behav., 2013

Equilibria of Generalized Cut and Choose Protocols.

[BibT_eX]

[DOI]

CoRR, 2013

Cake cutting: not just child's play.

[BibT_eX]

[DOI]

Commun. ACM, 2013

Harnessing the power of two crossmatches.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Optimizing password composition policies.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Defender (Mis)coordination in Security Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Externalities in Cake Cutting.

[BibT_eX]

[DOI]

Simina Brânzei

Jie Zhang

Proceedings of the IJCAI 2013, 2013

Audit Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - 4th International Conference, 2013

Dynamic Social Choice with Evolving Preferences.

[BibT_eX]

[DOI]

David C. Parkes

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Better Human Computation Through Principled Voting.

[BibT_eX]

[DOI]

Andrew Mao

Yiling Chen

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

How to Cut a Cake Before the Party Ends.

[BibT_eX]

[DOI]

John K. Lai

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

How Bad Is Selfish Voting?

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Algorithms for strategyproof classification.

[BibT_eX]

[DOI]

Artif. Intell., 2012

On the approximability of Dodgson and Young elections.

[BibT_eX]

[DOI]

Artif. Intell., 2012

A Maximum Likelihood Approach For Selecting Sets of Alternatives.

[BibT_eX]

[DOI]

Sashank Jakkam Reddi

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Social Choice for Human Computation.

[BibT_eX]

[DOI]

Andrew Mao

Yiling Chen

Proceedings of the 4th Human Computation Workshop, 2012

TurkServer: Enabling Synchronous and Longitudinal Online Experiments.

[BibT_eX]

[DOI]

Proceedings of the 4th Human Computation Workshop, 2012

Optimizing kidney exchange with transplant chains: theory and reality.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Dynamic Matching via Weighted Myopia with Application to Kidney Exchange.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

On Maxsum Fair Cake Divisions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

A Dynamic Rationalization of Distance Rationalizability.

[BibT_eX]

[DOI]

Craig Boutilier

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

A new perspective on implementation by voting trees.

[BibT_eX]

[DOI]

Felix A. Fischer

Alex Samorodnitsky

Random Struct. Algorithms, 2011

Computational social choice: the first four centuries.

[BibT_eX]

[DOI]

XRDS, 2011

Voting almost maximizes social welfare despite limited communication.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Sum of us: strategyproof selection from the selectors.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Towards More Expressive Cake Cutting.

[BibT_eX]

[DOI]

John K. Lai

Proceedings of the IJCAI 2011, 2011

Incentive design for adaptive agents.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Optimal Envy-Free Cake Cutting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Strategyproof Approximation of the Minimax on Networks.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

Incentive compatible regression learning.

[BibT_eX]

[DOI]

Ofer Dekel

Felix A. Fischer

J. Comput. Syst. Sci., 2010

A note on competitive diffusion through social networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Implementation by mediated equilibrium.

[BibT_eX]

[DOI]

Bezalel Peleg

Int. J. Game Theory, 2010

Walking in circles.

[BibT_eX]

[DOI]

Discret. Math., 2010

AI's War on Manipulation: Are We Winning?

[BibT_eX]

[DOI]

Piotr Faliszewski

AI Mag., 2010

Approximating power indices: theoretical and empirical analysis.

[BibT_eX]

[DOI]

Amin Saberi

Auton. Agents Multi Agent Syst., 2010

A scheduling approach to coalitional manipulation.

[BibT_eX]

[DOI]

Lirong Xia

Vincent Conitzer

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

Mix and match.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Tyler Moore

Allan Friedman

Proceedings of the 2010 Workshop on New Security Paradigms, 2010

On the limits of dictatorial classification.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Can Approximation Circumvent Gibbard-Satterthwaite?

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Strategyproof Approximation Mechanisms for Location on Networks

[BibT_eX]

[DOI]

CoRR, 2009

Algorithms for the coalitional manipulation problem.

[BibT_eX]

[DOI]

Michael Zuckerman

Artif. Intell., 2009

The learnability of voting rules.

[BibT_eX]

[DOI]

Yoni Peleg

Artif. Intell., 2009

Gossip-based aggregation of trust in decentralized reputation systems.

[BibT_eX]

[DOI]

Yoram Bachrach

Ariel Parnes

Auton. Agents Multi Agent Syst., 2009

Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Thou Shalt Covet Thy Neighbor's Cake.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Strategyproof Classification with Shared Inputs.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Nonmanipulable Selections from a Tournament.

[BibT_eX]

[DOI]

Alon Altman

Moshe Tennenholtz

Proceedings of the IJCAI 2009, 2009

2008

Computational voting theory : of the agents, by the agents, for the agents (עם תקציר בעברית, תכן ושער נוסף: תורת הבחירות החישובית.).

[BibT_eX]

[DOI]

PhD thesis, 2008

Towards a theory of incentives in machine learning.

[BibT_eX]

[DOI]

SIGecom Exch., 2008

On the complexity of achieving proportional representation.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2008

Complexity of Strategic Behavior in Multi-Winner Elections.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2008

A note on the query complexity of the Condorcet winner problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Frequent Manipulability of Elections: The Case of Two Voters.

[BibT_eX]

[DOI]

Shahar Dobzinski

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Automated design of scoring rules by learning from examples.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Approximating power indices.

[BibT_eX]

[DOI]

Yoram Bachrach

Evangelos Markakis

Amin Saberi

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Junta Distributions and the Average-Case Complexity of Manipulating Elections.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2007

Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Gossip-Based Aggregation of Trust in Decentralized Reputation Systems.

[BibT_eX]

[DOI]

Yoram Bachrach

Proceedings of the IJCAI 2007, 2007

On the robustness of preference aggregation in noisy environments.

[BibT_eX]

[DOI]

Gal A. Kaminka

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Learning Voting Trees.

[BibT_eX]

[DOI]

Yoni Peleg

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Voting in Cooperative Information Agent Scenarios: Use and Abuse.

[BibT_eX]

[DOI]

Proceedings of the Cooperative Information Agents X, 10th International Workshop, 2006

The Distortion of Cardinal Preferences in Voting.

[BibT_eX]

[DOI]

Proceedings of the Cooperative Information Agents X, 10th International Workshop, 2006

2005

Extensive-Form Argumentation Games.

[BibT_eX]

Proceedings of the EUMAS 2005, 2005

Learning to Identify Winning Coalitions in the PAC model.

[BibT_eX]

Proceedings of the EUMAS 2005, 2005

The Communication Complexity of Coalition Formation Among Autonomous Agents.

[BibT_eX]