Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Stable marriage). Showing records 1 – 17 of 17 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


The Ohio State University

1. Lennon, Craig. On the likely number of stable marriages.

Degree: PhD, Mathematics, 2007, The Ohio State University

 An instance of a size n - stable marriage problem involves n men and n women, each individually ranking all members of opposite sex in… (more)

Subjects/Keywords: Mathematics; Stable marriage; Probability; Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lennon, C. (2007). On the likely number of stable marriages. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095

Chicago Manual of Style (16th Edition):

Lennon, Craig. “On the likely number of stable marriages.” 2007. Doctoral Dissertation, The Ohio State University. Accessed February 26, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095.

MLA Handbook (7th Edition):

Lennon, Craig. “On the likely number of stable marriages.” 2007. Web. 26 Feb 2020.

Vancouver:

Lennon C. On the likely number of stable marriages. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2020 Feb 26]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095.

Council of Science Editors:

Lennon C. On the likely number of stable marriages. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095


Clemson University

2. Dabney, John. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.

Degree: PhD, Computer Science, 2010, Clemson University

 In this dissertation we focus on different variations of the stable matching (marriage) problem, initially posed by Gale and Shapley in 1962. In this problem,… (more)

Subjects/Keywords: Adaptive algorithms; heuristics; Stable marriage; Stable matching; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dabney, J. (2010). Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/664

Chicago Manual of Style (16th Edition):

Dabney, John. “Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.” 2010. Doctoral Dissertation, Clemson University. Accessed February 26, 2020. https://tigerprints.clemson.edu/all_dissertations/664.

MLA Handbook (7th Edition):

Dabney, John. “Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.” 2010. Web. 26 Feb 2020.

Vancouver:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Internet] [Doctoral dissertation]. Clemson University; 2010. [cited 2020 Feb 26]. Available from: https://tigerprints.clemson.edu/all_dissertations/664.

Council of Science Editors:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Doctoral Dissertation]. Clemson University; 2010. Available from: https://tigerprints.clemson.edu/all_dissertations/664


University of Waterloo

3. Szestopalow, Michael Jay. Properties of Stable Matchings.

Degree: 2010, University of Waterloo

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… (more)

Subjects/Keywords: Graph Theory; Stable Matchings; Linear Programming; Stable Marriage; Gale-Shapley

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Szestopalow, M. J. (2010). Properties of Stable Matchings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Szestopalow, Michael Jay. “Properties of Stable Matchings.” 2010. Thesis, University of Waterloo. Accessed February 26, 2020. http://hdl.handle.net/10012/5667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Szestopalow, Michael Jay. “Properties of Stable Matchings.” 2010. Web. 26 Feb 2020.

Vancouver:

Szestopalow MJ. Properties of Stable Matchings. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10012/5667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Szestopalow MJ. Properties of Stable Matchings. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Carolina

4. Hidakatsu, Joe. Structure of the Stable Marriage and Stable Roommate Problems and Applications.

Degree: MA, Mathematics, 2016, University of South Carolina

  The well-known Gale-Shapley algorithm is a solution to the stable marriage problem, but always results in the same stable marriage, regardless of how the… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Structure; Stable Marriage; Stable Roommate; Problems and Applications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hidakatsu, J. (2016). Structure of the Stable Marriage and Stable Roommate Problems and Applications. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3756

Chicago Manual of Style (16th Edition):

Hidakatsu, Joe. “Structure of the Stable Marriage and Stable Roommate Problems and Applications.” 2016. Masters Thesis, University of South Carolina. Accessed February 26, 2020. https://scholarcommons.sc.edu/etd/3756.

MLA Handbook (7th Edition):

Hidakatsu, Joe. “Structure of the Stable Marriage and Stable Roommate Problems and Applications.” 2016. Web. 26 Feb 2020.

Vancouver:

Hidakatsu J. Structure of the Stable Marriage and Stable Roommate Problems and Applications. [Internet] [Masters thesis]. University of South Carolina; 2016. [cited 2020 Feb 26]. Available from: https://scholarcommons.sc.edu/etd/3756.

Council of Science Editors:

Hidakatsu J. Structure of the Stable Marriage and Stable Roommate Problems and Applications. [Masters Thesis]. University of South Carolina; 2016. Available from: https://scholarcommons.sc.edu/etd/3756


UCLA

5. Rosenbaum, William Bailey. Distributed Almost Stable Matchings.

Degree: Mathematics, 2016, UCLA

 The Stable Marriage Problem (SMP) is concerned with the follow scenario: suppose we have two disjoint sets of agents—for example prospective students and colleges, medical… (more)

Subjects/Keywords: Mathematics; Computer science; Economics; communication complexity; computational complexity; distributed algorithms; stable marriage problem; stable matchings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rosenbaum, W. B. (2016). Distributed Almost Stable Matchings. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6pr8d66m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Thesis, UCLA. Accessed February 26, 2020. http://www.escholarship.org/uc/item/6pr8d66m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Web. 26 Feb 2020.

Vancouver:

Rosenbaum WB. Distributed Almost Stable Matchings. [Internet] [Thesis]. UCLA; 2016. [cited 2020 Feb 26]. Available from: http://www.escholarship.org/uc/item/6pr8d66m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rosenbaum WB. Distributed Almost Stable Matchings. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/6pr8d66m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


De Montfort University

6. Al Hakami, Hosam Hasan. Stable marriage problem based adaptation for clone detection and service selection.

Degree: PhD, 2015, De Montfort University

 Current software engineering topics such as clone detection and service selection need to improve the capability of detection process and selection process. The clone detection… (more)

Subjects/Keywords: 005.1; Stable Marriage Problem; Clone Detection; Service Selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al Hakami, H. H. (2015). Stable marriage problem based adaptation for clone detection and service selection. (Doctoral Dissertation). De Montfort University. Retrieved from http://hdl.handle.net/2086/11041

Chicago Manual of Style (16th Edition):

Al Hakami, Hosam Hasan. “Stable marriage problem based adaptation for clone detection and service selection.” 2015. Doctoral Dissertation, De Montfort University. Accessed February 26, 2020. http://hdl.handle.net/2086/11041.

MLA Handbook (7th Edition):

Al Hakami, Hosam Hasan. “Stable marriage problem based adaptation for clone detection and service selection.” 2015. Web. 26 Feb 2020.

Vancouver:

Al Hakami HH. Stable marriage problem based adaptation for clone detection and service selection. [Internet] [Doctoral dissertation]. De Montfort University; 2015. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2086/11041.

Council of Science Editors:

Al Hakami HH. Stable marriage problem based adaptation for clone detection and service selection. [Doctoral Dissertation]. De Montfort University; 2015. Available from: http://hdl.handle.net/2086/11041


University of Texas – Austin

7. -1410-4981. Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences.

Degree: PhD, Computer Science, 2017, University of Texas – Austin

 Unit-demand auctions have been heavily studied, in part because this model allows for a mechanism enjoying a remarkably strong combination of game-theoretic properties: efficiency, stability… (more)

Subjects/Keywords: Unit-demand auctions; VCG mechanism; Stable marriage; Strategyproofness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-1410-4981. (2017). Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/61907

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-1410-4981. “Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences.” 2017. Doctoral Dissertation, University of Texas – Austin. Accessed February 26, 2020. http://hdl.handle.net/2152/61907.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-1410-4981. “Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences.” 2017. Web. 26 Feb 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-1410-4981. Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2017. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2152/61907.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-1410-4981. Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences. [Doctoral Dissertation]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/61907

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

8. Wang, Xing. Optimizing ride matches for dynamic ride-sharing systems.

Degree: PhD, Industrial and Systems Engineering, 2013, Georgia Tech

 Ride-share systems, which aim to bring together travelers with similar itineraries and time schedules, may provide significant societal and environmental benefits by reducing the number… (more)

Subjects/Keywords: Stable matching; Stable marriage; Ridesharing; Mathematical optimization

…notion of stability is similar to that of the stable marriage problem. We develop notions of… …similar to that of the stable marriage problem. We develop notions of stable ride-share matching… …Time Flexibility and Cost Savings Threshold . . . . . . 57 9 Stable Matching Solution… …Weight Nearly Stable Matching M W N SM 1 Blocking Pairs Statistics… …79 Max Weight Nearly Stable Matching M W N SM 2 Blocking Pairs Statistics… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, X. (2013). Optimizing ride matches for dynamic ride-sharing systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47668

Chicago Manual of Style (16th Edition):

Wang, Xing. “Optimizing ride matches for dynamic ride-sharing systems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed February 26, 2020. http://hdl.handle.net/1853/47668.

MLA Handbook (7th Edition):

Wang, Xing. “Optimizing ride matches for dynamic ride-sharing systems.” 2013. Web. 26 Feb 2020.

Vancouver:

Wang X. Optimizing ride matches for dynamic ride-sharing systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1853/47668.

Council of Science Editors:

Wang X. Optimizing ride matches for dynamic ride-sharing systems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47668

9. Genc, Begum. An approach to robustness in stable marriage and stable roommates problems.

Degree: 2019, University College Cork

 This dissertation focuses on a novel concept of robustness within the context of matching problems. Our robustness notion for the stable matching framework is motivated… (more)

Subjects/Keywords: Robustness; (a,b)-supermatch; Optimization; Stable marriage; Stable roommates

…x28;right) for a sample Stable Marriage instance of size 7… …for men (left) and women (right) for a Stable Marriage instance I F of… …Table 5.5. . . . . . . . . . . . . . . . . . An Approach to Robustness in Stable Marriage vi… …Marriage vii and Stable Roommates Problems 151 151 160 166 166 169 170 174 175 181 Begüm Genç… …An Approach to Robustness in Stable Marriage viii and Stable Roommates Problems Begüm Genç… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Genc, B. (2019). An approach to robustness in stable marriage and stable roommates problems. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/8361

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Genc, Begum. “An approach to robustness in stable marriage and stable roommates problems.” 2019. Thesis, University College Cork. Accessed February 26, 2020. http://hdl.handle.net/10468/8361.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Genc, Begum. “An approach to robustness in stable marriage and stable roommates problems.” 2019. Web. 26 Feb 2020.

Vancouver:

Genc B. An approach to robustness in stable marriage and stable roommates problems. [Internet] [Thesis]. University College Cork; 2019. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10468/8361.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Genc B. An approach to robustness in stable marriage and stable roommates problems. [Thesis]. University College Cork; 2019. Available from: http://hdl.handle.net/10468/8361

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Florinda Lima do Nascimento. Transformação do conceito de família no âmbito jurídico.

Degree: 2009, Universidade Católica do Salvador

A dissertação traz como tema A Transformação do Conceito de Família no Âmbito Jurídico. Adota como marco os princípios constitucionais inseridos na Carta Magna de… (more)

Subjects/Keywords: família; união estável; casamento; dignidade; igualdade; solidariedade; CIENCIAS SOCIAIS APLICADAS; family; stable union; marriage; dignity; equality; solidarity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nascimento, F. L. d. (2009). Transformação do conceito de família no âmbito jurídico. (Thesis). Universidade Católica do Salvador. Retrieved from http://tede.ucsal.br/tde_busca/arquivo.php?codArquivo=220

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nascimento, Florinda Lima do. “Transformação do conceito de família no âmbito jurídico.” 2009. Thesis, Universidade Católica do Salvador. Accessed February 26, 2020. http://tede.ucsal.br/tde_busca/arquivo.php?codArquivo=220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nascimento, Florinda Lima do. “Transformação do conceito de família no âmbito jurídico.” 2009. Web. 26 Feb 2020.

Vancouver:

Nascimento FLd. Transformação do conceito de família no âmbito jurídico. [Internet] [Thesis]. Universidade Católica do Salvador; 2009. [cited 2020 Feb 26]. Available from: http://tede.ucsal.br/tde_busca/arquivo.php?codArquivo=220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nascimento FLd. Transformação do conceito de família no âmbito jurídico. [Thesis]. Universidade Católica do Salvador; 2009. Available from: http://tede.ucsal.br/tde_busca/arquivo.php?codArquivo=220

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Presbiteriana Mackenzie

11. Frederico Batista de Oliveira. A concretização constitucional do direito homoafetivo: da união estável ao casamento civil.

Degree: 2012, Universidade Presbiteriana Mackenzie

This study seeks to analyze the Homo-affective Law in order to apply the Constitutional Theory of Achievement as an interpretative method, which has the objective… (more)

Subjects/Keywords: homossexualidade; hermenêutica; união estável; casamento civil; homo-affectivity; homoafetividade; concretização constitucional; constitutional achievement; hermeneutics; stable union; civil marriage; homosexuality; DIREITO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oliveira, F. B. d. (2012). A concretização constitucional do direito homoafetivo: da união estável ao casamento civil. (Thesis). Universidade Presbiteriana Mackenzie. Retrieved from http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2578

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oliveira, Frederico Batista de. “A concretização constitucional do direito homoafetivo: da união estável ao casamento civil.” 2012. Thesis, Universidade Presbiteriana Mackenzie. Accessed February 26, 2020. http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2578.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oliveira, Frederico Batista de. “A concretização constitucional do direito homoafetivo: da união estável ao casamento civil.” 2012. Web. 26 Feb 2020.

Vancouver:

Oliveira FBd. A concretização constitucional do direito homoafetivo: da união estável ao casamento civil. [Internet] [Thesis]. Universidade Presbiteriana Mackenzie; 2012. [cited 2020 Feb 26]. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2578.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira FBd. A concretização constitucional do direito homoafetivo: da união estável ao casamento civil. [Thesis]. Universidade Presbiteriana Mackenzie; 2012. Available from: http://tede.mackenzie.com.br//tde_busca/arquivo.php?codArquivo=2578

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Clemson University

12. Munshi, Siddharth. FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS.

Degree: MS, Computer Science, 2007, Clemson University

 We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Baiou and Balinski in 2002. By… (more)

Subjects/Keywords: stable; marriage; allocation; bipartite; optimal; matching; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Munshi, S. (2007). FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/193

Chicago Manual of Style (16th Edition):

Munshi, Siddharth. “FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS.” 2007. Masters Thesis, Clemson University. Accessed February 26, 2020. https://tigerprints.clemson.edu/all_theses/193.

MLA Handbook (7th Edition):

Munshi, Siddharth. “FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS.” 2007. Web. 26 Feb 2020.

Vancouver:

Munshi S. FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS. [Internet] [Masters thesis]. Clemson University; 2007. [cited 2020 Feb 26]. Available from: https://tigerprints.clemson.edu/all_theses/193.

Council of Science Editors:

Munshi S. FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS. [Masters Thesis]. Clemson University; 2007. Available from: https://tigerprints.clemson.edu/all_theses/193


University of South Africa

13. Philpin, Elizabeth Mary. Stable matching in preference relationships .

Degree: 2009, University of South Africa

 It is the aim of this paper to review some of the work done on stable matching, and on stable marriage problems in particular. Variants… (more)

Subjects/Keywords: Stable marriage; Matching algorithms; College admissions problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Philpin, E. M. (2009). Stable matching in preference relationships . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/778

Chicago Manual of Style (16th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Doctoral Dissertation, University of South Africa. Accessed February 26, 2020. http://hdl.handle.net/10500/778.

MLA Handbook (7th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Web. 26 Feb 2020.

Vancouver:

Philpin EM. Stable matching in preference relationships . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10500/778.

Council of Science Editors:

Philpin EM. Stable matching in preference relationships . [Doctoral Dissertation]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/778

14. Damianidis, Ioannis. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.

Degree: Business and IT, 2011, University of Borås

“The Stable marriage problem (SMP) is basically the problem of finding a stable matching between two sets of persons, the men and the women,… (more)

Subjects/Keywords: stable marriage problem; genetic algorithm; maximum egalitarian happiness matching; maximizing criteria; Engineering and Technology; Teknik och teknologier

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Damianidis, I. (2011). The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. (Thesis). University of Borås. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Damianidis, Ioannis. “The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.” 2011. Thesis, University of Borås. Accessed February 26, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Damianidis, Ioannis. “The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.” 2011. Web. 26 Feb 2020.

Vancouver:

Damianidis I. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. [Internet] [Thesis]. University of Borås; 2011. [cited 2020 Feb 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Damianidis I. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. [Thesis]. University of Borås; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. McConvey, Andrew Ross. Sufficient conditions for the existence of specified subgraphs in graphs.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G. It is usually computationally complex… (more)

Subjects/Keywords: Combinatorics; Graph theory; Extremal graph theory; Cycles; Disjoint cycles; Graph packing; Turán number; List packing; Matching; Stable matching; Stable marriage

…assigned partner. This problem, known as the Stable Marriage problem was introduced in 1962 by… …Gale and Shapley. Theorem 1.4.1. [21] Every instance of the stable marriage problem… …1976, Knuth proposed extending the stable marriage problem to 3 dimensions [36]. To… …is to determine if it is always possible to find a stable marriage. Question 1.4.2. Does… …15 We will also consider one final variation of the stable marriage problem, the cyclic s… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

McConvey, A. R. (2017). Sufficient conditions for the existence of specified subgraphs in graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97294

Chicago Manual of Style (16th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 26, 2020. http://hdl.handle.net/2142/97294.

MLA Handbook (7th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Web. 26 Feb 2020.

Vancouver:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2142/97294.

Council of Science Editors:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97294

16. Boyd, Rebecca Suzanne. Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation.

Degree: MS, 2014, Brigham Young University

  Gottman's (1994a) three stable conflict resolution styles (CRSs), validating, volatile, and avoidant, are different on several dimensions, yet all are predictors of good marital… (more)

Subjects/Keywords: conflict resolution styles; regulated and stable styles; commitment; relationship self-regulation; Marriage and Family Therapy and Counseling

…are all considered stable ways to resolve conflict and interact in marriage; however, each… …relationship sometimes require engaging in or avoiding conflict? Conflict in marriage is sometimes… …landmark marriage study, 73 couples were asked to discuss a problem area of continuing… …validating, volatile, and avoidant styles were labeled as stable CRSs and hostile was labeled as… …predict stable and satisfactory marriages, why has therapy not adapted to reflect that finding… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Boyd, R. S. (2014). Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5189&context=etd

Chicago Manual of Style (16th Edition):

Boyd, Rebecca Suzanne. “Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation.” 2014. Masters Thesis, Brigham Young University. Accessed February 26, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5189&context=etd.

MLA Handbook (7th Edition):

Boyd, Rebecca Suzanne. “Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation.” 2014. Web. 26 Feb 2020.

Vancouver:

Boyd RS. Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation. [Internet] [Masters thesis]. Brigham Young University; 2014. [cited 2020 Feb 26]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5189&context=etd.

Council of Science Editors:

Boyd RS. Stable Conflict Resolution Styles and Commitment: Their Roles in Marital Relationship Self-Regulation. [Masters Thesis]. Brigham Young University; 2014. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5189&context=etd

17. Bailey, James P. The Price of deception in social choice.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

 Most social choice algorithms rely on private data from individuals to maximize a social utility. However, many algorithms are manipulable  – an individual can manipulate… (more)

Subjects/Keywords: Game theory; Price of deception; Minimal dishonesty; Social choice; Voting; Borda; Plurality; Copeland; Majority judgment; Veto; Facility location; Assignments; Stable marriage; Gale-Shapley; College admission; Student placement

Stable Marriage . . . . . . . . . . . . . . . . . . . . . . . . 147 6.1 Introduction… …6.3 Equilibria of the Strategic Stable Marriage Game . . . . . . . . . . . . . . 163 6.3.1… …Equilibria of the Strategic Stable Marriage Game . . . . . . . . . . 193 6.6.2 The Gale-Shapley… …for plurality elections. xv Stable Marriage: We show that for all marriage algorithms… …sincerely stable marriage. This result supports the use of algorithms less biased than the (… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bailey, J. P. (2017). The Price of deception in social choice. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59189

Chicago Manual of Style (16th Edition):

Bailey, James P. “The Price of deception in social choice.” 2017. Doctoral Dissertation, Georgia Tech. Accessed February 26, 2020. http://hdl.handle.net/1853/59189.

MLA Handbook (7th Edition):

Bailey, James P. “The Price of deception in social choice.” 2017. Web. 26 Feb 2020.

Vancouver:

Bailey JP. The Price of deception in social choice. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1853/59189.

Council of Science Editors:

Bailey JP. The Price of deception in social choice. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59189

.