Готові списки джерел за темами / Algorithmic mechanism

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Algorithmic mechanism"

Автор: Grafiati

Опубліковано: 7 червня 2025

Оновлено: 2 серпня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Algorithmic mechanism".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Algorithmic mechanism"

Nisan, Noam, and Amir Ronen. "Algorithmic Mechanism Design." Games and Economic Behavior 35, no. 1-2 (2001): 166–96. http://dx.doi.org/10.1006/game.1999.0790.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chawla, Shuchi, and Balasubramanian Sivan. "Bayesian algorithmic mechanism design." ACM SIGecom Exchanges 13, no. 1 (2014): 5–49. http://dx.doi.org/10.1145/2692375.2692378.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Jiayi. "Updating the Gatekeeper in the New Media Age: The Algorithm." Lecture Notes in Education Psychology and Public Media 4, no. 1 (2023): 284–88. http://dx.doi.org/10.54254/2753-7048/4/20220333.

Повний текст джерела

Анотація:

In the era of new media, an algorithmic recommendation mechanism is widely used by social media platforms as a new type of gatekeeper and has greatly affected people's entertainment methods and habits. Algorithms collect and analyze user data and then recommend similar content to users based on relevant tags and keywords. Although this provides users with a personalized experience, this personalized service unconsciously forms an information cocoon, which can easily limit people's cognition. It is the purpose of this article to let the audience understand the impact of the algorithmic recommen

Стилі APA, Harvard, Vancouver, ISO та ін.

Akbarpour, Mohammad, Scott Duke Kominers, Kevin Michael Li, Shengwu Li, and Paul Milgrom. "Algorithmic Mechanism Design With Investment." Econometrica 91, no. 6 (2023): 1969–2003. http://dx.doi.org/10.3982/ecta19559.

Повний текст джерела

Анотація:

We study the investment incentives created by truthful mechanisms that allocate resources using approximation algorithms. Some approximation algorithms guarantee nearly 100% of the optimal welfare in the allocation problem but guarantee nothing when accounting for investment incentives. An algorithm's allocative and investment guarantees coincide if and only if its confirming negative externalities are sufficiently small. We introduce fast approximation algorithms for the knapsack problem that have no confirming negative externalities and guarantees close to 100% for both allocation and invest

Стилі APA, Harvard, Vancouver, ISO та ін.

Pei, Yan. "Algorithmic Mechanism Design of Evolutionary Computation." Computational Intelligence and Neuroscience 2015 (2015): 1–17. http://dx.doi.org/10.1155/2015/591954.

Повний текст джерела

Анотація:

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individ

Стилі APA, Harvard, Vancouver, ISO та ін.

Chen, Zhiling, and Chen Shi. "Analysis of Algorithm Recommendation Mechanism of TikTok." International Journal of Education and Humanities 4, no. 1 (2022): 12–14. http://dx.doi.org/10.54097/ijeh.v4i1.1152.

Повний текст джерела

Анотація:

Algorithmic recommendation technology is used in all walks of life, among which the application in the news media industry has achieved great development. As a major mainstream mode of content distribution, algorithmic recommendation is well applied to the TikTok, enabling it to accurately and efficiently push video content that users are interested in. As algorithmic recommendation gradually becomes an indispensable part of content operation, analyzing the algorithmic recommendation mechanism will help the platform to better attract and serve users, so that users can get a better experience a

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Song. "The Dilemma of Algorithmic Recommendation Mechanism of E-commerce Platform and Its Countermeasures." Advances in Economics, Management and Political Sciences 70, no. 1 (2024): 209–16. http://dx.doi.org/10.54254/2754-1169/70/20231699.

Повний текст джерела

Анотація:

E-commerce, as a convenient and flexible way of shopping, has become the largest, fastest-growing and widest-coverage component of China's digital economic development. At the same time, with the continuous progress of technology and the evolution of user needs, major e-commerce platforms are also committed to using the personalized and diversified features of the algorithmic recommendation mechanism to stimulate consumers' purchasing behavior. However, we can't ignore the fact that the widespread application of algorithmic recommendation mechanisms has brought some negative impacts to consume

Стилі APA, Harvard, Vancouver, ISO та ін.

Kahng, Anson, Simon Mackenzie, and Ariel Procaccia. "Liquid Democracy: An Algorithmic Perspective." Journal of Artificial Intelligence Research 70 (March 24, 2021): 1223–52. http://dx.doi.org/10.1613/jair.1.12261.

Повний текст джерела

Анотація:

We study liquid democracy, a collective decision making paradigm that allows voters to transitively delegate their votes, through an algorithmic lens. In our model, there are two alternatives, one correct and one incorrect, and we are interested in the probability that the majority opinion is correct. Our main question is whether there exist delegation mechanisms that are guaranteed to outperform direct voting, in the sense of being always at least as likely, and sometimes more likely, to make a correct decision. Even though we assume that voters can only delegate their votes to better-informe

Стилі APA, Harvard, Vancouver, ISO та ін.

Guo, Qiuyun. "Algorithmic control and gig workers’ facades of conformity: A work stress perspective." Social Behavior and Personality: an international journal 52, no. 1 (2024): 1–13. http://dx.doi.org/10.2224/sbp.12904.

Повний текст джерела

Анотація:

I examined the relationship between algorithmic control and gig workers’ facades of conformity by investigating the underlying mechanism. Drawing on the challenge???hindrance stress model, I explored the mediating role of challenge stress and hindrance stress in this relationship. Then, by using data collected from an online food delivery platform in China, I demonstrated that hindrance stress positively mediated the relationship between algorithmic control and facades of conformity, but the mediating effect of challenge stress was not significant. This study contributes to the emerging resear

Стилі APA, Harvard, Vancouver, ISO та ін.

Dughmi, Shaddin, and Tim Roughgarden. "Black-Box Randomized Reductions in Algorithmic Mechanism Design." SIAM Journal on Computing 43, no. 1 (2014): 312–36. http://dx.doi.org/10.1137/110843654.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Algorithmic mechanism"

Cai, Yang Ph D. Massachusetts Institute of Technology. "Mechanism design : a new algorithmic framework." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82344.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 168-175).<br>A modern engineering system, e.g. the Internet, faces challenges from both the strategic behavior of its self-interested participants and the inherent computational intractability of large systems. Responding to this challenge, a new field, Algorithmic Mechanism Design, has emerged. One of the most fundamental problems in this field is How to optimize revenue in an auction? In his sem

Стилі APA, Harvard, Vancouver, ISO та ін.

Guo, Minzhe. "Algorithmic Mechanism Design for Data Replication Problems." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470757536.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Thielen, Clemens [Verfasser]. "Approximation and Complexity in Algorithmic Mechanism Design / Clemens Thielen." München : Verlag Dr. Hut, 2010. http://d-nb.info/1002608104/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fadaei, Salman [Verfasser], Martin [Akademischer Betreuer] [Gutachter] Bichler, and Susanne [Gutachter] Albers. "Algorithmic Mechanism Design via Relaxation and Rounding / Salman Fadaei ; Gutachter: Martin Bichler, Susanne Albers ; Betreuer: Martin Bichler." München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1118722361/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Karande, Chinmay. "Algorithms and mechanism design for multi-agent systems." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/37229.

Повний текст джерела

Анотація:

A scenario where multiple entities interact with a common environment to achieve individual and common goals either co-operatively or competitively can be classified as a Multi-Agent System. In this thesis, we concentrate on the situations where the agents exhibit selfish, competitive and strategic behaviour, giving rise to interesting game theoretic and optimization problems. From a computational point of view, the presence of multiple agents introduces strategic and temporal issues, apart from enhancing the difficulty of optimization. We study the following natural mathematical models of s

Стилі APA, Harvard, Vancouver, ISO та ін.

Haddouni, Mounia. "Algorithmes de résolution de la dynamique du contact avec impact et frottement." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAI022/document.

Повний текст джерела

Анотація:

La simulation des systèmes multicorps avec une dynamique non régulière trouve ses applications dans différents domaines comme l'aéronautique, l'automobile, le ferroviaire, la robotique, la réalité virtuelle et même l'industrie horlogère. Ces industries ont de plus en plus d'exigences sur la rapidité ainsi que la précision des méthodes utilisées pour calculer la dynamique. Par conséquent, la recherche dans le domaine de la mécanique non régulière est très active et a pour objectif constant de proposer des algorithmes plus robustes et plus rapides pour calculer la dynamique ainsi que de développ

Стилі APA, Harvard, Vancouver, ISO та ін.

Williams, Cristyn Barry. "Colour constancy : human mechanisms and machine algorithms." Thesis, City University London, 1995. http://openaccess.city.ac.uk/7731/.

Повний текст джерела

Анотація:

This thesis describes a quantitative experimental investigation into instantaneous colour constancy in humans. Colour constancy may be defined as the ability of the visual system to maintain a constant colour percept of a surface despite varying conditions of illumination. Instantaneous, in this context, refers to effects which happen very rapidly with the change of illumination, rather than those which may be due to long term adaptation of the photoreceptors. The results of experiments are discussed in the context of current computational models of colour constancy. Experiments on subjects wi

Стилі APA, Harvard, Vancouver, ISO та ін.

Cortés, Juan. "Motion planning algorithms for general closed-chain mechanisms." Phd thesis, Institut National Polytechnique de Toulouse - INPT, 2003. http://tel.archives-ouvertes.fr/tel-00011002.

Повний текст джерела

Анотація:

Un système robotique agit par le mouvement dans un monde physique. La capacité deplanification de mouvement est donc une composante essentielle de l'autonomie du système et constitue un domaine de recherche très actif en Robotique. Le champ d'application de ces méthodes dépasse aujourd'hui le cadre de la Robotique et intéresse des domaines aussi diversifiés que la CAO, la logistique industrielle, l'animation graphique ou la biologie moléculaire. Dans tous ces domaines on est confronté au mouvement de systèmes complexes contenant des chaînes cinématiques fermées. Cette thèse traite de la planif

Стилі APA, Harvard, Vancouver, ISO та ін.

Connor, Andrew Miles. "The synthesis of hybrid mechanisms using genetic algorithms." Thesis, Liverpool John Moores University, 1996. http://researchonline.ljmu.ac.uk/5570/.

Повний текст джерела

Анотація:

This thesis presents a novel design methodology for the synthesis of hybrid mechanisms using Genetic Algorithms. GAs are a search and optimisation method which model the mechanics of population genetics to give a truly global search method. In parallel to the development of a suitable GA, the work also develops novel objective function criteria which go some way to providing an approximation to dynamic criteria whilst using only kinematic properties during calculations. This has considerable effect in reducing the time required to find a feasible solution. The thesis presents a set of results

Стилі APA, Harvard, Vancouver, ISO та ін.

Zainiev, Timur. "Quantum mechanics and the greedy algorithm." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614850.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Algorithmic mechanism"

Jiao, Yutao, Ping Wang, and Dusit Niyato. Algorithmic Mechanism Design for Internet of Things Services Market. Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7353-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

E, Marsden Jerrold, Patrick George W. 1958-, and Shadwick W. F. 1951-, eds. Integration algorithms and classical mechanics. American Mathematical Society, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hussaini, M. Y. Algorithmic Trends in Computational Fluid Dynamics. Springer New York, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chi-Wang, Shu, Atkins H. L, and Langley Research Center, eds. A comparison of two formulations for high order accurate essentially non-oscillatory schemes. National Aeronautics and Space Administration, Langley Research Center, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xue, Dongjie. Fractal Algorithm and Its Application in Rock Mechanics. Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-9716-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rattray, Lars Magnus. Modelling the dynamics of genetic algorithms using statistical mechanics. University of Manchester, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Th, Sonar, and Thomas Ingo, eds. Discrete modelling and discrete algorithms in continuum mechanics: Proceedings of the GAMM workshop. Logos, 2001.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kostyukov, Viktor. Molecular mechanics of biopolymers. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1010677.

Повний текст джерела

Анотація:

The monograph is devoted to molecular mechanics simulations of biologically important polymers like proteins and nucleic acids. It is shown that the algorithms based on the classical laws of motion of Newton, with high-quality parameterization and sufficient computing resources is able to correctly reproduce and predict the structure and dynamics of macromolecules in aqueous solution. Summarized the development path of biopolymers molecular mechanics, its theoretical basis, current status and prospects for further progress.  It may be useful to researchers specializing in molecular Bioph

Стилі APA, Harvard, Vancouver, ISO та ін.

Thomas, Schwager, ed. Computational granular dynamics: Models and algorithms. Springer-Verlag, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Algorithmic mechanism"

Lavi, Ron. "Algorithmic Mechanism Design." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lavi, Ron. "Algorithmic Mechanism Design." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Monderer, Dov. "Monotonicity in Mechanism Design." In Algorithmic Game Theory. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04645-2_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Garg, Jugal, and Peter McGlaughlin. "A Truthful Mechanism for Interval Scheduling." In Algorithmic Game Theory. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99660-8_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fikioris, Giannis, and Dimitris Fotakis. "Mechanism Design for Perturbation Stable Combinatorial Auctions." In Algorithmic Game Theory. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57980-7_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kyropoulou, Maria, Carmine Ventre, and Xiaomeng Zhang. "Mechanism Design for Constrained Heterogeneous Facility Location." In Algorithmic Game Theory. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30473-7_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Azar, Yossi, and Ety Khaitsin. "Prompt Mechanism for Ad Placement over Time." In Algorithmic Game Theory. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24829-0_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Brokkelkamp, Ruben, Sjir Hoeijmakers, and Guido Schäfer. "Greater Flexibility in Mechanism Design Through Altruism." In Algorithmic Game Theory. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15714-1_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Xiuzhen, Yao Zhang, and Dengji Zhao. "Incentive Compatible Mechanism for Influential Agent Selection." In Algorithmic Game Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85947-3_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Filos-Ratsikas, Aris, and Alexandros A. Voudouris. "Approximate Mechanism Design for Distributed Facility Location." In Algorithmic Game Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85947-3_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Algorithmic mechanism"

Ma, Fanglan, Changsheng Zhu, Peng Lei, and Xuefang Gong. "Knowledge Tracing Based on Memory Mechanism." In 2025 4th Asia Conference on Algorithms, Computing and Machine Learning (CACML). IEEE, 2025. https://doi.org/10.1109/cacml64929.2025.11010967.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Feigenbaum, Joan, and Scott Shenker. "Distributed algorithmic mechanism design." In the 6th international workshop. ACM Press, 2002. http://dx.doi.org/10.1145/570810.570812.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hartline, Jason D., and Brendan Lucier. "Bayesian algorithmic mechanism design." In the 42nd ACM symposium. ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806732.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hartline, Jason D., and Brendan Lucier. "Bayesian algorithmic mechanism design." In the Behavioral and Quantitative Game Theory. ACM Press, 2010. http://dx.doi.org/10.1145/1807406.1807425.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nisan, Noam, and Amir Ronen. "Algorithmic mechanism design (extended abstract)." In the thirty-first annual ACM symposium. ACM Press, 1999. http://dx.doi.org/10.1145/301250.301287.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fu, Hu, Brendan Lucier, Balasubramanian Sivan, and Vasilis Syrgkanis. "Cost-recovering bayesian algorithmic mechanism design." In EC '13: ACM Conference on Electronic Commerce. ACM, 2013. http://dx.doi.org/10.1145/2482540.2482591.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fu, Hu, Brendan Lucier, Balasubramanian Sivan, and Vasilis Syrgkanis. "Cost-recovering bayesian algorithmic mechanism design." In the fourteenth ACM conference. ACM Press, 2013. http://dx.doi.org/10.1145/2492002.2482591.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dughmi, Shaddin, and Tim Roughgarden. "Black-Box Randomized Reductions in Algorithmic Mechanism Design." In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.79.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zi, Shuai, and Jun Wu. "Synthesizing Efficient Social Laws based on Algorithmic Mechanism Design." In ACAI 2023: 2023 6th International Conference on Algorithms, Computing and Artificial Intelligence. ACM, 2023. http://dx.doi.org/10.1145/3639631.3639653.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Finocchiaro, Jessie, Roland Maio, Faidra Monachou, et al. "Bridging Machine Learning and Mechanism Design towards Algorithmic Fairness." In FAccT '21: 2021 ACM Conference on Fairness, Accountability, and Transparency. ACM, 2021. http://dx.doi.org/10.1145/3442188.3445912.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Algorithmic mechanism"

Cordeiro de Amorim, Renato. A survey on feature weighting based K-Means algorithms. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.79.

Повний текст джерела

Анотація:

In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algo

Стилі APA, Harvard, Vancouver, ISO та ін.

Farhi, Edward, and Jeffrey Goldstone. Algorithms Speedup From Quantum Mechanics. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada442558.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mayerhoffer, Daniel, Moritz Schulz, Simon Scheller, and Jan Schulz-Gebhard. Networks of Polarisation : A Generative Mechanism. Otto-Friedrich-Universität Bamberg, 2025. https://doi.org/10.20378/irb-108470.

Повний текст джерела

Анотація:

This paper presents a generative algorithm for simulating network polarisation based on attitudinal homophily, i.e., the tendency to connect to others with similar attitudes as oneself. To do so, it applies the notion of preferential attachment to node properties other than degree, aiding intuitive communication within and beyond the network science community. The algorithm works with one or more flexibly weighted attitude dimensions, heterogeneous populations. The generated networks commonly share features of real-world social networks such as (weak) small-worldiness. They can contribute to h

Стилі APA, Harvard, Vancouver, ISO та ін.

Elacqua, Gregory, Isabel Jacas, Thomas Krussig, Carolina Méndez, and Christopher Neilson. The Welfare Effects of including Household Preferences in School Assignment Systems: Evidence from Ecuador. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004676.

Повний текст джерела

Анотація:

We study the welfare produced by a coordinated school assignment system that is based exclusively on minimizing distance to schools, comparing the matches it produces to a system that includes household preferences using a deferred acceptance algorithm. We leverage administrative data and a mechanism change implemented in the city of Manta, Ecuador in 2021 to estimate household preferences and show that considering applicant preferences produces large welfare gains. Our counterfactual exercises show that differences across alternative assignment mechanisms are small. Survey data on household b

Стилі APA, Harvard, Vancouver, ISO та ін.

Housley, R., J. Gray, and T. Okubo. Using Key Encapsulation Mechanism (KEM) Algorithms in the Cryptographic Message Syntax (CMS). RFC Editor, 2024. http://dx.doi.org/10.17487/rfc9629.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tupek, Michael, and Brandon Talamini. Optimization-based algorithms for nonlinear mechanics and frictional contact. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1820695.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Elacqua, Gregory, Anne Sofie Westh Olsen, and Santiago Velez-Ferro. Open configuration options The Market Design Approach to Teacher Assignment: Evidence from Ecuador. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003824.

Повний текст джерела

Анотація:

We study the advantages, trade-offs, and challenges of employing a centralized rule to determine the allocation of teachers to schools. Data come from the centralized teacher assignment program in Ecuador, "Quiero ser Maestro," conducted by the Ministry of Education. Notably, in 2019 the program transitioned from a priority based algorithm to a strategy proof mechanism, similar to the change introduced in Boston in 2005 to assign students to schools. Using the reported preferences, we conduct a counterfactual analysis and nd substantive evidence that the adjustment in algorithm resulted in gre

Стилі APA, Harvard, Vancouver, ISO та ін.

HAALAND, DAVID M., CHRISTINE M. WEHLBURG, LAURA E. MARTIN, et al. Improved Materials Aging Diagnostics and Mechanisms through 2D Hyperspectral Imaging Methods and Algorithms. Office of Scientific and Technical Information (OSTI), 2002. http://dx.doi.org/10.2172/800773.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Oiwa, Y., H. Watanabe, H. Takagi, K. Maeda, T. Hayashi, and Y. Ioku. Mutual Authentication Protocol for HTTP: Cryptographic Algorithms Based on the Key Agreement Mechanism 3 (KAM3). RFC Editor, 2017. http://dx.doi.org/10.17487/rfc8121.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Patel, Reena. Complex network analysis for early detection of failure mechanisms in resilient bio-structures. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41042.

Повний текст джерела

Анотація:

Bio-structures owe their remarkable mechanical properties to their hierarchical geometrical arrangement as well as heterogeneous material properties. This dissertation presents an integrated, interdisciplinary approach that employs computational mechanics combined with flow network analysis to gain fundamental insights into the failure mechanisms of high performance, light-weight, structured composites by examining the stress flow patterns formed in the nascent stages of loading for the rostrum of the paddlefish. The data required for the flow network analysis was generated from the finite ele

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!