Author of the publication

Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making.

, , , , , and . CHI, page 600:1-600:16. ACM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Persuading a pessimist: Simplicity and robustness.. Games Econ. Behav., (2021)Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 209-225. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Approximation Algorithms for Computing Maximin Share Allocations., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 39-51. Springer, (2015)Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems., and . ICALP (2), volume 8573 of Lecture Notes in Computer Science, page 568-607. Springer, (2014)What matters in school choice tie-breaking? How competition guides design., and . J. Econ. Theory, (2020)Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making., , , , , and . CHI, page 600:1-600:16. ACM, (2023)Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison., , and . EC, page 755-756. ACM, (2015)Optimal Dynamic Allocation: Simplicity through Information Design., , and . EC, page 101-102. ACM, (2021)Constrained Majorization: Applications in Mechanism Design.. EC, page 330-331. ACM, (2022)Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies., and . Manag. Sci., 70 (8): 5187-5207 (2024)