( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making.

, , , , , и . CHI, стр. 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.

Nima Nikzad

Afshin Bassiri

Afshin Sepehri

Afshin Abbasi

Afshin Karimi

 

Другие публикации лиц с тем же именем

Persuading a pessimist: Simplicity and robustness.. Games Econ. Behav., (2021)What matters in school choice tie-breaking? How competition guides design., и . J. Econ. Theory, (2020)Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison., , и . EC, стр. 755-756. ACM, (2015)Optimal Dynamic Allocation: Simplicity through Information Design., , и . EC, стр. 101-102. ACM, (2021)Constrained Majorization: Applications in Mechanism Design.. EC, стр. 330-331. ACM, (2022)Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making., , , , , и . CHI, стр. 600:1-600:16. ACM, (2023)Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems., и . ICALP (2), том 8573 из Lecture Notes in Computer Science, стр. 568-607. Springer, (2014)What Matters in School Choice Tie-breakings?: How Competition Guides Design., и . EC, стр. 767-768. ACM, (2016)Optimal Iterative Pricing over Social Networks (Extended Abstract)., , , , , и . WINE, том 6484 из Lecture Notes in Computer Science, стр. 415-423. Springer, (2010)Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem., , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 209-225. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)