Relevant bibliographies by topics / Algoritmo de Gale e Shapley

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Algoritmo de Gale e Shapley'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algoritmo de Gale e Shapley.'

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.

Journal articles on the topic "Algoritmo de Gale e Shapley"

1

Dworczak, Piotr. "Deferred Acceptance with Compensation Chains." Operations Research 69, no. 2 (2021): 456–68. http://dx.doi.org/10.1287/opre.2020.2042.

Full text
Abstract:
In a foundational paper, Gale and Shapley (1962) introduced the deferred acceptance algorithm that achieves a stable outcome in a two-sided matching market by letting one side of the market make proposals to the other side. What happens when both sides of the market can propose? In “Deferred Acceptance with Compensation Chains,” Dworczak answers this question by constructing an equitable version of the Gale–Shapley algorithm in which the sequence of proposers can be arbitrary. The main result of the paper shows that the extended algorithm, equipped with so-called compensation chains, is not on
APA, Harvard, Vancouver, ISO, and other styles
2

Shen, Weiran, Yuan Deng, and Pingzhong Tang. "Coalitional permutation manipulations in the Gale-Shapley algorithm." Artificial Intelligence 301 (December 2021): 103577. http://dx.doi.org/10.1016/j.artint.2021.103577.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Greenwell, Raymond N., and Daniel E. Seabold. "The Stable Pairing Problem." Mathematics Teacher 107, no. 6 (2014): 446–50. http://dx.doi.org/10.5951/mathteacher.107.6.0446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Floréen, Patrik, Petteri Kaski, Valentin Polishchuk, and Jukka Suomela. "Almost Stable Matchings by Truncating the Gale–Shapley Algorithm." Algorithmica 58, no. 1 (2009): 102–18. http://dx.doi.org/10.1007/s00453-009-9353-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ishida, Yoshiteru, and Shigetaka Ikeno. "Asymmetry of Strategies in Proposal: Gale-Shapley Algorithm on Diagrams." Procedia Computer Science 96 (2016): 1730–39. http://dx.doi.org/10.1016/j.procs.2016.08.221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kobayashi, Hirotatsu, and Tomomi Matsui. "Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists." Algorithmica 58, no. 1 (2009): 151–69. http://dx.doi.org/10.1007/s00453-009-9359-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zacharia, Nasia, Evi Papaioannou, and Christos Kaklamanis. "An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm." Electronic Journal of Graph Theory and Applications 8, no. 1 (2020): 29–57. http://dx.doi.org/10.5614/ejgta.2020.8.1.4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ryskin, Konstantin E., Mokhannad Abdulsalam Yunus Al Askari, and Sergey A. Fedosin. "IMPLEMENTATION OF THE GALE-SHAPLEY ALGORITHM FOR AUTOMATING RECEPTION OF UNIVERSITY APPLICANTS." Mordovia University Bulletin 26, no. 4 (2016): 462–74. http://dx.doi.org/10.15507/0236-2910.026.201604.462-474.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mohd Hussin, Naimah, and Ammar Azlan. "Matching Final Year Project Topics with Students using Stable Marriage Model." Journal of Computing Research and Innovation 2, no. 1 (2018): 29–35. http://dx.doi.org/10.24191/jcrinn.v2i1.27.

Full text
Abstract:
Every semester, a new batch of final year students needs to find a topic and a supervisor to complete their final year project requirement. The problem with the current approach is that it is based on first come first serve. So, the pairing between student and supervisor is not the optimal ones, i.e. some students may not get their preferred topic or supervisor. Plus, it is also time consuming for both students and supervisors. The researcher is motivated to solve this long overdue problem by applying a stable marriage model tha t is introduced by Gale and Shapley hence the name Gale - Shapley
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Feng, Lin Zhang, Yongkui Liu, and Yuanjun Laili. "QoS-Aware Service Composition in Cloud Manufacturing: A Gale–Shapley Algorithm-Based Approach." IEEE Transactions on Systems, Man, and Cybernetics: Systems 50, no. 7 (2020): 2386–97. http://dx.doi.org/10.1109/tsmc.2018.2814686.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Algoritmo de Gale e Shapley"

1

Bardella, Felipe Palmeira. "Alocação de estudantes aos centros de pós-graduação em economia no Brasil: um experimento natural em organização de mercado." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/.

Full text
Abstract:
Apresentamos a teoria sobre mercados de dois lados, centralizados e descentralizados, para analisar o mercado de admissão de estudantes aos Centros de Pós-graduação em Economia no Brasil ao longo dos últimos 15 anos. Iniciamos descrevendo a história da organização deste mercado até a época atual. As falhas do sistema descentralizado e as hipóteses sobre o insucesso do procedimento centralizado de 1997 são discutidas. Observações empíricas são utilizadas para propor um modelo teórico que represente aproximadamente o atual mecanismo descentralizado e explique a aparente duradoura aplicação desse
APA, Harvard, Vancouver, ISO, and other styles
2

Guneydas, Ismail. "ACTOR POSITIONING IN WIRELESS SENSOR AND ACTOR NETWORKS USING MATCHING THEORY." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1674095431&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text
Abstract:
Thesis (M.S.)--Southern Illinois University Carbondale, 2008.<br>"Department of Computer Science." Keywords: Gale-Shapley, Wireless sensor networks. Includes bibliographical references (p. 42-45). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
3

Abreu, Luis Carlos Martins. "Mecanismos de SeleÃÃo de Gale-Shapley DinÃmicos em Universidades Brasileiras: SISU, SISUα, SISU&#946." Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10167.

Full text
Abstract:
FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico<br>No Brasil, a busca pela reduÃÃo das ineficiÃncias observadas na alocaÃÃo de vagas em instituiÃÃes de ensino superior via o tradicional vestibular levou à formulaÃÃo e implantaÃÃo de um mecanismo alternativo de seleÃÃo para admissÃo superior: o Sistema de SeleÃÃo Unificada (SISU), criado em 2010. O mecanismo, tecnicamente falando, à um algoritmo de matching com as seguintes caracterÃsticas: i) cada estudante que recebe oferta de matrÃcula decide por aceitar ou rejeitar a oferta recebida; ii) rejeiÃÃes de ofertas provocam
APA, Harvard, Vancouver, ISO, and other styles
4

Sibert, Courtney. "School Choice and Voucher Systems: A Comparison of the Drivers of Educational Achievement and of Private School Choice." Scholarship @ Claremont, 2012. http://scholarship.claremont.edu/scripps_theses/106.

Full text
Abstract:
Despite promotion by well-known economists and supporting economic theory, econometric analyses of voucher systems often find that they have been unsuccessful in improving traditional measures of educational success. This paper examines a possible explanation of this phenomenon by comparing the drivers of educational achievement and of school popularity by examining private school choice. The findings of this paper indicate that there is a disconnect between school success and school popularity, which adversely effects both the demand and supply-side benefits of voucher systems. Additionally,
APA, Harvard, Vancouver, ISO, and other styles
5

Abreu, Luís Carlos Martins. "Mecanismos de seleção de Gale-Shapley dinâmicos em Universidades Brasilieiras; SISU, SISU (Alpha) e SISU (beta)." reponame:Repositório Institucional da UFC, 2013. http://www.repositorio.ufc.br/handle/riufc/5453.

Full text
Abstract:
Submitted by Mônica Correia Aquino (monicacorreiaaquino@gmail.com) on 2013-07-22T21:35:25Z No. of bitstreams: 1 2013_dissert_lcmabreu.pdf: 1002718 bytes, checksum: 2f64c6cbbef9d1e575a9e8a9890c85ff (MD5)<br>Approved for entry into archive by Mônica Correia Aquino(monicacorreiaaquino@gmail.com) on 2013-07-22T21:35:37Z (GMT) No. of bitstreams: 1 2013_dissert_lcmabreu.pdf: 1002718 bytes, checksum: 2f64c6cbbef9d1e575a9e8a9890c85ff (MD5)<br>Made available in DSpace on 2013-07-22T21:35:37Z (GMT). No. of bitstreams: 1 2013_dissert_lcmabreu.pdf: 1002718 bytes, checksum: 2f64c6cbbef9d1e575a9e8a9890c85ff
APA, Harvard, Vancouver, ISO, and other styles
6

Lai, Chien-Yu, and 賴建宇. "SC-FDMA Uplink Resource Allocation Algorithm Based on Gale-Shapley Algorithm." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/01215623014093844071.

Full text
Abstract:
碩士<br>國立中央大學<br>資訊工程研究所<br>99<br>LTE (Long Term Evolution) is a candidate of 4G network released by 3GPP.In downlink ,LTE uses Orthogonal FDMA (OFDMA) as its multiple access and Single-Carrier FDMA (SC-FDMA) as its uplink multiple access technique. The main difference between OFDMA and SC-FDMA is that the OFDMA has higher PAPR.PAPR of OFDMA values than that of the SC-FDMA. Another difference is the mechanism of resource allocation. In SC-FDMA, it uses two manners to assign resource: localized FDMA (L-FDMA) and interleaved FDMA (I-FDMA).LFDMA performs better throughput and IFDMA has lower PAPR,
APA, Harvard, Vancouver, ISO, and other styles
7

You-TingJau and 趙祐霆. "Gale-Shapley-Algorithm Based Resource Allocation Scheme for Device-to-Device Communications Underlaying Downlink Cellular Networks." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/7vwadx.

Full text
Abstract:
碩士<br>國立成功大學<br>電腦與通信工程研究所<br>103<br>Device-to-Device (D2D) communications underlaying cellular networks can improve the network capacity and spectrum efficiency by sharing the cellular resources in the direct-transmission mode. However, the stringent interference between D2D and cellular systems can seriously repress the overall performance improvement. In this thesis, we aim to solve this dilemma by applying the concept of differentiated priority into the resources sharing problem among the D2D pairs and cellular users. Firstly, we modified the conventional partial time-frequency resource al
APA, Harvard, Vancouver, ISO, and other styles
8

Szestopalow, Michael Jay. "Properties of Stable Matchings." Thesis, 2010. http://hdl.handle.net/10012/5667.

Full text
Abstract:
Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in many areas of mathematics, computer science, economics, and even medicine. This thesis studies stable matchings in graphs and hypergraphs. We begin by introducing the work of Gale and Shapley. Their main contribution was the proof that every bipartite graph has a stable matching. Our discussion revolves around the Gale-Shapley algorithm and highlights some of the interesting pr
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algoritmo de Gale e Shapley"

1

Huang, Chien-Chung. "Cheating by Men in the Gale-Shapley Stable Matching Algorithm." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11841036_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Eguchi, Akinobu, Satoru Fujishige, and Akihisa Tamura. "A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model." In Algorithms and Computation. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24587-2_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gutiérrez-Rondón, Giuliana, and Juan Gutiérrez-Cárdenas. "Matching System for Animal-Assisted Therapy Based on the Levenshtein and Gale-Shapley Algorithms." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63092-8_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pudasaini, Shushanta, Subarna Shakya, Sagar Lamichhane, Sajjan Adhikari, Aakash Tamang, and Sujan Adhikari. "Scoring of Resume and Job Description Using Word2vec and Matching Them Using Gale–Shapley Algorithm." In Expert Clouds and Applications. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-2126-0_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Teo, Chung-Piaw, Jay Sethuraman, and Wee-Peng Tan. "Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48777-8_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gubitoso, Aline Guarnieri, and Vinicius Cifú Lopes. "O algoritmo de Gale-Shapley." In Alocações, estabilidade e otimização: uma introdução passo a passo. Editora UFABC, 2017. http://dx.doi.org/10.7476/9788568576823.0002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"The Gale—Shapley Algorithm and Future Job Markets." In Game Sutra: Rescuing Game Theory from The Game Theorists. SAGE Publications Pvt. Ltd, 2019. http://dx.doi.org/10.4135/9789353885694.n52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bleakley, Chris. "Needles in Haystacks." In Poems That Solve Puzzles. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198853732.003.0006.

Full text
Abstract:
Chapter 6 examines one of the greatest unsolved challenges in mathematics - the problem of finding the best solution from a large number of possibilities. The Traveling Salesman Problem requires that the shortest tour of a group of cities is determined. Surprisingly, the only way to guarantee finding the shortest tour is to measure the length of all possible tours. Exhaustive search such as this is very slow. For centuries, mathematicians have sought to find fast algorithms for solving combinatorial search problems. The most famous was invented by Edsger Dijkstra in 1956. Dijkstra’s algorithm finds the shortest route between cities on a roadmap and is now used in all satellite navigation apps. The Gale-Shapley algorithm solves the problem of matching pairs of items according to user preferences. John Holland took the radical step of accelerating combinatorial search by mimicking natural evolution in a computer.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhou, Zhenyu, Zheng Chang, Chen Xu, and Tapani Ristaniemi. "Stable-Matching-Based Energy-Efficient Context-Aware Resource Allocation for Ultra-Dense Small Cells." In Advances in Wireless Technologies and Telecommunication. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-1712-2.ch002.

Full text
Abstract:
Implementing caching to ultra-densely deployed small cells provides a promising solution for satisfying the stringent quality of service (QoS) requirements of delay-sensitive applications with limited backhaul capacity. With the rapidly increasing energy consumption, in this chapter, the authors investigate the NP-hard energy-efficient context-aware resource allocation problem and formulate it as a one-to-one matching problem. The preference lists in the matching are modeled based on the optimum energy efficiency (EE) under specified matching, which can be obtained by using an iterative power allocation algorithm based on nonlinear fractional programming and Lagrange dual decomposition. Next, on account of the Gale-Shapley algorithm, an energy-efficient matching algorithm is proposed. Some properties of the proposed algorithm are discussed and analyzed in detail. Moreover, the authors extend the algorithm to the matching with indifferent and incomplete preference lists. Finally, the significant performance gain of the proposed algorithm is demonstrated through simulation results.
APA, Harvard, Vancouver, ISO, and other styles
10

Chiappori, Pierre-André. "Matching under Transferable Utility: Theory." In Matching with Transfers. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691171739.003.0003.

Full text
Abstract:
This chapter considers the theory of matching under transferable utility (TU). It first introduces a formal definition of the TU property: a group satisfies TU if there exists monotone transformations of individual utilities such that the Pareto frontier is a hyperplane. It then examines the cornerstone of the theory of nontransferable utility (NTU) matching, namely, the Gale-Shapley algorithm, before turning to a discussion of a crucial property of matching models under TU: their intrinsic relationship with optimal transportation. It also describes the notions of supermodularity and assortativeness, along with individual utilities and intrahousehold allocation. Finally, it looks at hedonic models, taking into account hedonic equilibrium and stable matching, and presents two examples that illustrate the relationship between matching and hedonic models: a competitive IO model and randomized matching.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algoritmo de Gale e Shapley"

1

Elviwani, E., Andysah Putera Utama Siahaan, and Liza Fitriana. "Performance-based Stable Matching using Gale-Shapley Algorithm." In Joint Workshop KO2PI and The 1st International Conference on Advance & Scientific Innovation. EAI, 2018. http://dx.doi.org/10.4108/eai.23-4-2018.2277597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vaish, Rohit, and Dinesh Garg. "Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/62.

Full text
Abstract:
We study the problem of manipulation of the men-proposing Gale-Shapley algorithm by a single woman via permutation of her true preference list. Our contribution is threefold: First, we show that the matching induced by an optimal manipulation is stable with respect to the true preferences. Second, we identify a class of optimal manipulations called inconspicuous manipulations which, in addition to preserving stability, are also nearly identical to the true preference list of the manipulator (making the manipulation hard to be detected). Third, for optimal inconspicuous manipulations, we streng
APA, Harvard, Vancouver, ISO, and other styles
3

Carano, Elena L., Shih-Yuan Liu, and J. Karl Hedrick. "Applying the Gale-Shapley Stable Matching Algorithm to Peer Human-Robot Task Allocation." In ASME 2014 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/dscc2014-5953.

Full text
Abstract:
When human and robotic agents work together, the challenge in assigning tasks lies in exploiting human strengths, such as expertise and intuition, while still managing the heterogeneous agent team in a near-optimal way. An extension to the Gale-Shapley stable matching algorithm that combines a sequential greedy approach is proposed to apply to task allocation missions. Conventional task features are modeled in the form of task preferences; agent inputs are modeled in the form of agent preferences. The algorithm is applied to a bomb defusal scenario, where bomb location is known but time for ea
APA, Harvard, Vancouver, ISO, and other styles
4

Meulbroek, Daniel, Daniel Ferguson, Mathew Ohland, and Frederick Berry. "Forming More Effective Teams Using CATME TeamMaker and the Gale-Shapley Algorithm." In 2019 IEEE Frontiers in Education Conference (FIE). IEEE, 2019. http://dx.doi.org/10.1109/fie43999.2019.9028552.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tomasin, Stefano. "A Gale-Shapley algorithm for allocation of relayed parallel wiretap coding channels." In 2015 IEEE Conference on Communications and Network Security (CNS). IEEE, 2015. http://dx.doi.org/10.1109/cns.2015.7346819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tahir, Mohammad, M. H. Habaebi, and M. Rafiqul Islam. "Coalition formation for cooperative spectrum sharing in cognitive radio wireless networks using Gale Shapley algorithm." In 2015 IEEE 6th Control and System Graduate Research Colloquium (ICSGRC). IEEE, 2015. http://dx.doi.org/10.1109/icsgrc.2015.7412462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, Wenson, You-Ting Jau, Szu-Lin Su, and Yinman Lee. "Gale-Shapley-algorithm based resource allocation scheme for device-to-device communications underlaying downlink cellular networks." In 2016 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2016. http://dx.doi.org/10.1109/wcnc.2016.7564742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kotthoff, Lars, Alexandre Fréchette, Tomasz Michalak, Talal Rahwan, Holger H. Hoos, and Kevin Leyton-Brown. "Quantifying Algorithmic Improvements over Time." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/716.

Full text
Abstract:
Assessing the progress made in AI and contributions to the state of the art is of major concern to the community. Recently, Frechette et al. [2016] advocated performing such analysis via the Shapley value, a concept from coalitional game theory. In this paper, we argue that while this general idea is sound, it unfairly penalizes older algorithms that advanced the state of the art when introduced, but were then outperformed by modern counterparts. Driven by this observation, we introduce the temporal Shapley value, a measure that addresses this problem while maintaining the desirable properties
APA, Harvard, Vancouver, ISO, and other styles
9

Shen, Qiangwang, Meng Ding, Shuqin Li, Wentao Du, and Wenlong Zhao. "Research on Jiuqi Game Strategy Based on Chess Shape." In ACAI 2020: 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence. ACM, 2020. http://dx.doi.org/10.1145/3446132.3446175.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kumabe, Soh, and Takanori Maehara. "Convexity of b-matching Games." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/37.

Full text
Abstract:
The b-matching game is a cooperative game defined on a graph. The game generalizes the matching game to allow each individual to have more than one partner. The game has several applications, such as the roommate assignment, the multi-item version of the seller-buyer assignment, and the international kidney exchange. Compared with the standard matching game, the b-matching game is computationally hard. In particular, the core non-emptiness problem and the core membership problem are co-NP-hard. Therefore, we focus on the convexity of the game, which is a sufficient condition of the core non-em
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography