Journal articles on the topic 'Strategyproofne'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Strategyproofne.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Brandt, Felix, Martin Bullinger, and Patrick Lederer. "On the Indecisiveness of Kelly-Strategyproof Social Choice Functions." Journal of Artificial Intelligence Research 73 (April 1, 2022): 1093–130. http://dx.doi.org/10.1613/jair.1.13449.
Full textDhull, Komal, Steven Jecmen, Pravesh Kothari, and Nihar B. Shah. "Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators’ Expertise." Proceedings of the AAAI Conference on Human Computation and Crowdsourcing 10, no. 1 (October 14, 2022): 53–63. http://dx.doi.org/10.1609/hcomp.v10i1.21987.
Full textGuo, Xiaoxi, Sujoy Sikdar, Lirong Xia, Yongzhi Cao, and Hanpin Wang. "Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms." Journal of Artificial Intelligence Research 76 (January 21, 2023): 287–339. http://dx.doi.org/10.1613/jair.1.13878.
Full textBrandt, Felix, and Christian Geist. "Finding Strategyproof Social Choice Functions via SAT Solving." Journal of Artificial Intelligence Research 55 (March 4, 2016): 565–602. http://dx.doi.org/10.1613/jair.4959.
Full textBudish, Eric, and Estelle Cantillon. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard." American Economic Review 102, no. 5 (August 1, 2012): 2237–71. http://dx.doi.org/10.1257/aer.102.5.2237.
Full textChida, Takafumi, Toshiya Kaihara, Nobutada Fujii, Daisuke Kokuryo, and Yuma Shiho. "Computational Study on Strategyproofness of Resource Matching in Crowdsourced Manufacturing." International Journal of Automation Technology 14, no. 5 (September 5, 2020): 734–43. http://dx.doi.org/10.20965/ijat.2020.p0734.
Full textZou, James, Sujit Gujar, and David Parkes. "Tolerable Manipulability in Dynamic Assignment without Money." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 947–52. http://dx.doi.org/10.1609/aaai.v24i1.7630.
Full textBichler, Martin, Zhen Hao, Richard Littmann, and Stefan Waldherr. "Strategyproof auction mechanisms for network procurement." OR Spectrum 42, no. 4 (July 25, 2020): 965–94. http://dx.doi.org/10.1007/s00291-020-00597-7.
Full textAziz, Haris, Hau Chan, Barton Lee, Bo Li, and Toby Walsh. "Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1806–13. http://dx.doi.org/10.1609/aaai.v34i02.5547.
Full textHaeringer, Guillaume, and Hanna Hałaburda. "Monotone strategyproofness." Games and Economic Behavior 98 (July 2016): 68–77. http://dx.doi.org/10.1016/j.geb.2016.05.007.
Full textMeir, Reshef, and Jeffrey S. Rosenschein. "Strategyproof classification." ACM SIGecom Exchanges 10, no. 3 (December 2011): 21–25. http://dx.doi.org/10.1145/2325702.2325708.
Full textXu, Xinping, Bo Li, Minming Li, and Lingjie Duan. "Two-facility Location Games with Minimum Distance Requirement." Journal of Artificial Intelligence Research 70 (February 17, 2021): 719–56. http://dx.doi.org/10.1613/jair.1.12319.
Full textMennle, Timo, and Sven Seuken. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem." Journal of Economic Theory 191 (January 2021): 105144. http://dx.doi.org/10.1016/j.jet.2020.105144.
Full textMutuswami, Suresh. "Strategyproofness, Non-Bossiness and Group Strategyproofness in a cost sharing model." Economics Letters 89, no. 1 (October 2005): 83–88. http://dx.doi.org/10.1016/j.econlet.2005.05.012.
Full textProcaccia, Ariel. "Can Approximation Circumvent Gibbard-Satterthwaite?" Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 836–41. http://dx.doi.org/10.1609/aaai.v24i1.7619.
Full textMeir, Reshef, Ariel D. Procaccia, and Jeffrey S. Rosenschein. "Algorithms for strategyproof classification." Artificial Intelligence 186 (July 2012): 123–56. http://dx.doi.org/10.1016/j.artint.2012.03.008.
Full textChambers, Christopher P., and Nicolas S. Lambert. "Dynamic Belief Elicitation." Econometrica 89, no. 1 (2021): 375–414. http://dx.doi.org/10.3982/ecta15293.
Full textBreton, Michel Le, and Arunava Sen. "Separable Preferences, Strategyproofness, and Decomposability." Econometrica 67, no. 3 (May 1999): 605–28. http://dx.doi.org/10.1111/1468-0262.00038.
Full textBrandt, Felix. "Set-monotonicity implies Kelly-strategyproofness." Social Choice and Welfare 45, no. 4 (February 17, 2015): 793–804. http://dx.doi.org/10.1007/s00355-015-0881-8.
Full textMitra, Manipushpak, and Suresh Mutuswami. "Group strategyproofness in queueing models." Games and Economic Behavior 72, no. 1 (May 2011): 242–54. http://dx.doi.org/10.1016/j.geb.2010.06.011.
Full textBirmpas, Georgios, Evangelos Markakis, and Guido Schäfer. "Cost Sharing over Combinatorial Domains." ACM Transactions on Economics and Computation 10, no. 1 (March 31, 2022): 1–26. http://dx.doi.org/10.1145/3505586.
Full textPapai, Szilvia. "Strategyproof Assignment by Hierarchical Exchange." Econometrica 68, no. 6 (November 2000): 1403–33. http://dx.doi.org/10.1111/1468-0262.00166.
Full textBahel, Eric, and Yves Sprumont. "Strategyproof Choice of Social Acts." American Economic Review 110, no. 2 (February 1, 2020): 596–627. http://dx.doi.org/10.1257/aer.20171553.
Full textLi, Zongpeng, and Xiaowen Chu. "On Achieving Group-Strategyproof Multicast." IEEE Transactions on Parallel and Distributed Systems 23, no. 5 (May 2012): 913–23. http://dx.doi.org/10.1109/tpds.2011.197.
Full textPápai, Szilvia. "Strategyproof exchange of indivisible goods." Journal of Mathematical Economics 39, no. 8 (November 2003): 931–59. http://dx.doi.org/10.1016/s0304-4068(03)00053-3.
Full textP�pai, Szilvia. "Strategyproof single unit award rules." Social Choice and Welfare 18, no. 4 (October 1, 2001): 785–98. http://dx.doi.org/10.1007/s003550000084.
Full textPapai, Szilvia. "Strategyproof and Nonbossy Multiple Assignments." Journal of Public Economic Theory 3, no. 3 (July 2001): 257–71. http://dx.doi.org/10.1111/1097-3923.00066.
Full textFragiadakis, Daniel, Atsushi Iwasaki, Peter Troyan, Suguru Ueda, and Makoto Yokoo. "Strategyproof Matching with Minimum Quotas." ACM Transactions on Economics and Computation 4, no. 1 (January 5, 2016): 1–40. http://dx.doi.org/10.1145/2841226.
Full textPápai, Szilvia. "Strategyproof multiple assignment using quotas." Review of Economic Design 5, no. 1 (March 1, 2000): 91–105. http://dx.doi.org/10.1007/s100580050049.
Full textBordes, Georges, Gilbert Laffond, and Michel Le Breton. "Euclidean preferences, option sets and strategyproofness." SERIEs 2, no. 4 (July 23, 2011): 469–83. http://dx.doi.org/10.1007/s13209-011-0075-2.
Full textMennle, Timo, and Sven Seuken. "Relaxing strategyproofness in one-sided matching." ACM SIGecom Exchanges 13, no. 1 (November 25, 2014): 64–67. http://dx.doi.org/10.1145/2692375.2692381.
Full textChen, Yiling, Chara Podimata, Ariel D. Procaccia, and Nisarg Shah. "Strategyproof linear regression in high dimensions." ACM SIGecom Exchanges 17, no. 1 (May 7, 2019): 54–60. http://dx.doi.org/10.1145/3331033.3331038.
Full textGopinathan, A., Zongpeng Li, and Baochun Li. "Group Strategyproof Multicast in Wireless Networks." IEEE Transactions on Parallel and Distributed Systems 22, no. 5 (May 2011): 708–15. http://dx.doi.org/10.1109/tpds.2010.184.
Full textTerzopoulou, Zoi, and Ulle Endriss. "Strategyproof judgment aggregation under partial information." Social Choice and Welfare 53, no. 3 (April 20, 2019): 415–42. http://dx.doi.org/10.1007/s00355-019-01191-9.
Full textFotakis, Dimitris, and Christos Tzamos. "Strategyproof facility location with concave costs." ACM SIGecom Exchanges 12, no. 2 (November 25, 2014): 46–49. http://dx.doi.org/10.1145/2692359.2692370.
Full textKothari, Anshul, David C. Parkes, and Subhash Suri. "Approximately-strategyproof and tractable multiunit auctions." Decision Support Systems 39, no. 1 (March 2005): 105–21. http://dx.doi.org/10.1016/j.dss.2004.08.009.
Full textRosenthal, Edward C. "Information and strategyproofness in joint project selection." Journal of Public Economics 68, no. 2 (May 1998): 207–21. http://dx.doi.org/10.1016/s0047-2727(97)00089-3.
Full textAziz, Haris, Florian Brandl, Felix Brandt, and Markus Brill. "On the tradeoff between efficiency and strategyproofness." Games and Economic Behavior 110 (July 2018): 1–18. http://dx.doi.org/10.1016/j.geb.2018.03.005.
Full textFlammini, Michele, Bojana Kodric, and Giovanna Varricchio. "Strategyproof Mechanisms for Friends and Enemies Games." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1950–57. http://dx.doi.org/10.1609/aaai.v34i02.5565.
Full textFlammini, Michele, Bojana Kodric, and Giovanna Varricchio. "Strategyproof mechanisms for Friends and Enemies Games." Artificial Intelligence 302 (January 2022): 103610. http://dx.doi.org/10.1016/j.artint.2021.103610.
Full textFotakis, Dimitris, and Christos Tzamos. "Strategyproof Facility Location for Concave Cost Functions." Algorithmica 76, no. 1 (July 14, 2015): 143–67. http://dx.doi.org/10.1007/s00453-015-0026-6.
Full textBorodin, Allan, Mark Braverman, Brendan Lucier, and Joel Oren. "Strategyproof Mechanisms for Competitive Influence in Networks." Algorithmica 78, no. 2 (June 2, 2016): 425–52. http://dx.doi.org/10.1007/s00453-016-0169-0.
Full textAlon, Noga, Michal Feldman, Ariel D. Procaccia, and Moshe Tennenholtz. "Strategyproof Approximation of the Minimax on Networks." Mathematics of Operations Research 35, no. 3 (August 2010): 513–26. http://dx.doi.org/10.1287/moor.1100.0457.
Full textKamble, Vijay, and Jean Walrand. "Strategyproof Mechanisms for Purchasing a Shared Resource." ACM SIGMETRICS Performance Evaluation Review 42, no. 3 (December 8, 2014): 4–7. http://dx.doi.org/10.1145/2695533.2695536.
Full textMukherjee, Conan. "On group strategyproof and optimal object allocation." Economic Theory Bulletin 8, no. 2 (June 16, 2020): 289–304. http://dx.doi.org/10.1007/s40505-020-00184-7.
Full textSprumont, Yves. "A note on strategyproofness in Edgeworth-Box economies." Economics Letters 49, no. 1 (July 1995): 45–50. http://dx.doi.org/10.1016/0165-1765(94)00646-j.
Full textBade, Sophie. "Fairness and group-strategyproofness clash in assignment problems." Journal of Economic Theory 165 (September 2016): 257–62. http://dx.doi.org/10.1016/j.jet.2016.04.012.
Full textChun, Youngsub, Manipushpak Mitra, and Suresh Mutuswami. "Egalitarian equivalence and strategyproofness in the queueing problem." Economic Theory 56, no. 2 (December 25, 2013): 425–42. http://dx.doi.org/10.1007/s00199-013-0793-8.
Full textHossain, Safwan, Evi Micha, and Nisarg Shah. "The Surprising Power of Hiding Information in Facility Location." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 2168–75. http://dx.doi.org/10.1609/aaai.v34i02.5592.
Full textSun, Yu-E., He Huang, Xiang-Yang Li, Yang Du, Miaomiao Tian, Hongli Xu, and Mingjun Xiao. "Privacy-preserving strategyproof auction mechanisms for resource allocation." Tsinghua Science and Technology 22, no. 2 (April 2017): 119–34. http://dx.doi.org/10.23919/tst.2017.7889635.
Full text