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 matching). Showing records 1 – 26 of 26 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Waterloo

1. Tofigzade, Natig. An Algorithm for Stable Matching with Approximation up to the Integrality Gap.

Degree: 2020, University of Waterloo

 In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of… (more)

Subjects/Keywords: Combinatorial Optimization; Stable Matching; Algorithmic Game Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tofigzade, N. (2020). An Algorithm for Stable Matching with Approximation up to the Integrality Gap. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16052

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):

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Thesis, University of Waterloo. Accessed September 18, 2020. http://hdl.handle.net/10012/16052.

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

MLA Handbook (7th Edition):

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Web. 18 Sep 2020.

Vancouver:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10012/16052.

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

Council of Science Editors:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16052

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


University of Washington

2. Weber, Robbie. Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments.

Degree: PhD, 2020, University of Washington

 This thesis discusses three problems around the common theme of pairing off agents. While the techniques vary, in each problem we observe that careful application… (more)

Subjects/Keywords: online matching; stable marriage; stable matching; tournament; Computer science; Computer science and engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weber, R. (2020). Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/45927

Chicago Manual of Style (16th Edition):

Weber, Robbie. “Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments.” 2020. Doctoral Dissertation, University of Washington. Accessed September 18, 2020. http://hdl.handle.net/1773/45927.

MLA Handbook (7th Edition):

Weber, Robbie. “Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments.” 2020. Web. 18 Sep 2020.

Vancouver:

Weber R. Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments. [Internet] [Doctoral dissertation]. University of Washington; 2020. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1773/45927.

Council of Science Editors:

Weber R. Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments. [Doctoral Dissertation]. University of Washington; 2020. Available from: http://hdl.handle.net/1773/45927


University of California – San Diego

3. Moeller, Daniel Paul. Exploiting Structure in the Stable Matching Problem.

Degree: Computer Science, 2016, University of California – San Diego

Stable matching is a widely studied problem in social choice theory. For the basiccentralized case, an optimal quadratic time algorithm is known. However, we presentseveral… (more)

Subjects/Keywords: Computer science; Complexity; Decentralized; Jealousy Graph; Stable Matching; Structure; Succinct

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moeller, D. P. (2016). Exploiting Structure in the Stable Matching Problem. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/6f80v7jc

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):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Thesis, University of California – San Diego. Accessed September 18, 2020. http://www.escholarship.org/uc/item/6f80v7jc.

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

MLA Handbook (7th Edition):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Web. 18 Sep 2020.

Vancouver:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Sep 18]. Available from: http://www.escholarship.org/uc/item/6f80v7jc.

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

Council of Science Editors:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/6f80v7jc

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


University of Washington

4. Levy, Avi William. Novel uses of the Mallows model in coloring and matching.

Degree: PhD, 2017, University of Washington

 A natural model of a highly ordered random ranking is the Mallows model. Disorder is measured by the number of inversions; these are pairs of… (more)

Subjects/Keywords: algorithm; matching; permutation; probability; ranking; stable; Mathematics; Statistics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Levy, A. W. (2017). Novel uses of the Mallows model in coloring and matching. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/40243

Chicago Manual of Style (16th Edition):

Levy, Avi William. “Novel uses of the Mallows model in coloring and matching.” 2017. Doctoral Dissertation, University of Washington. Accessed September 18, 2020. http://hdl.handle.net/1773/40243.

MLA Handbook (7th Edition):

Levy, Avi William. “Novel uses of the Mallows model in coloring and matching.” 2017. Web. 18 Sep 2020.

Vancouver:

Levy AW. Novel uses of the Mallows model in coloring and matching. [Internet] [Doctoral dissertation]. University of Washington; 2017. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1773/40243.

Council of Science Editors:

Levy AW. Novel uses of the Mallows model in coloring and matching. [Doctoral Dissertation]. University of Washington; 2017. Available from: http://hdl.handle.net/1773/40243


University of Texas – Austin

5. Lam, Chi Kit. Algorithms for stable matching with indifferences.

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

 In the stable matching problem, given a two-sided matching market where each agent has ordinal preferences over the agents on the other side, we would… (more)

Subjects/Keywords: Stable matching; Group strategyproofness; Pareto-optimality; Approximation algorithm; Integrality gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lam, C. K. (2019). Algorithms for stable matching with indifferences. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5856

Chicago Manual of Style (16th Edition):

Lam, Chi Kit. “Algorithms for stable matching with indifferences.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed September 18, 2020. http://dx.doi.org/10.26153/tsw/5856.

MLA Handbook (7th Edition):

Lam, Chi Kit. “Algorithms for stable matching with indifferences.” 2019. Web. 18 Sep 2020.

Vancouver:

Lam CK. Algorithms for stable matching with indifferences. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2020 Sep 18]. Available from: http://dx.doi.org/10.26153/tsw/5856.

Council of Science Editors:

Lam CK. Algorithms for stable matching with indifferences. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5856


University of Toronto

6. Drummond, Joanna. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.

Degree: PhD, 2017, University of Toronto

Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matching, and various labour market matchings. Many of these matching markets run centralized matching(more)

Subjects/Keywords: Algorithmic Game Theory; Artificial Intelligence; Computational Economics; Stable Matching; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Drummond, J. (2017). Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/80643

Chicago Manual of Style (16th Edition):

Drummond, Joanna. “Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.” 2017. Doctoral Dissertation, University of Toronto. Accessed September 18, 2020. http://hdl.handle.net/1807/80643.

MLA Handbook (7th Edition):

Drummond, Joanna. “Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges.” 2017. Web. 18 Sep 2020.

Vancouver:

Drummond J. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1807/80643.

Council of Science Editors:

Drummond J. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/80643


Georgia Tech

7. Soldner, Mallory. Optimization and measurement in humanitarian operations: addressing practical needs.

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

 This thesis focuses on three topics relevant to humanitarian applications: (i) stable and complete assignment of staff members to field offices, (ii) bottleneck management for… (more)

Subjects/Keywords: Humanitarian supply chain; Stable matching; Transport networks; Congestion; Performance measurement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soldner, M. (2014). Optimization and measurement in humanitarian operations: addressing practical needs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52332

Chicago Manual of Style (16th Edition):

Soldner, Mallory. “Optimization and measurement in humanitarian operations: addressing practical needs.” 2014. Doctoral Dissertation, Georgia Tech. Accessed September 18, 2020. http://hdl.handle.net/1853/52332.

MLA Handbook (7th Edition):

Soldner, Mallory. “Optimization and measurement in humanitarian operations: addressing practical needs.” 2014. Web. 18 Sep 2020.

Vancouver:

Soldner M. Optimization and measurement in humanitarian operations: addressing practical needs. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1853/52332.

Council of Science Editors:

Soldner M. Optimization and measurement in humanitarian operations: addressing practical needs. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52332

8. Mai, Tung. Distributive lattices, stable matchings, and robust solutions.

Degree: PhD, Computer Science, 2018, Georgia Tech

 The stable matching problem, first presented by mathematical economists Gale and Shapley, has been studied extensively since its introduction. As a result, a remarkably rich… (more)

Subjects/Keywords: Distributive lattice; Stable matching

…SUMMARY The stable matching problem, first presented by mathematical economists Gale and… …extend our understanding on several algorithmic and structural aspects of stable matching. We… …summarize the main contributions of the thesis as follows: 1. Generalizing stable matching to… …maximum weight stable matching. We study a natural generalization of stable matching to the… …maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm… 

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):

Mai, T. (2018). Distributive lattices, stable matchings, and robust solutions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60238

Chicago Manual of Style (16th Edition):

Mai, Tung. “Distributive lattices, stable matchings, and robust solutions.” 2018. Doctoral Dissertation, Georgia Tech. Accessed September 18, 2020. http://hdl.handle.net/1853/60238.

MLA Handbook (7th Edition):

Mai, Tung. “Distributive lattices, stable matchings, and robust solutions.” 2018. Web. 18 Sep 2020.

Vancouver:

Mai T. Distributive lattices, stable matchings, and robust solutions. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1853/60238.

Council of Science Editors:

Mai T. Distributive lattices, stable matchings, and robust solutions. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60238


California State University – Northridge

9. Waheed, Areeba. Investigation of algorithms for variants of the Stable Matching Problem.

Degree: MS, Computer Science, 2020, California State University – Northridge

 The purpose of this study is to explore and provide alternative algorithms for three variants of the stable matching problem. The Stable Matching Problem is… (more)

Subjects/Keywords: Stable Matching with Forbidden Pairs; Dissertations, Academic  – CSUN  – Computer Science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Waheed, A. (2020). Investigation of algorithms for variants of the Stable Matching Problem. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.3/216431

Chicago Manual of Style (16th Edition):

Waheed, Areeba. “Investigation of algorithms for variants of the Stable Matching Problem.” 2020. Masters Thesis, California State University – Northridge. Accessed September 18, 2020. http://hdl.handle.net/10211.3/216431.

MLA Handbook (7th Edition):

Waheed, Areeba. “Investigation of algorithms for variants of the Stable Matching Problem.” 2020. Web. 18 Sep 2020.

Vancouver:

Waheed A. Investigation of algorithms for variants of the Stable Matching Problem. [Internet] [Masters thesis]. California State University – Northridge; 2020. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10211.3/216431.

Council of Science Editors:

Waheed A. Investigation of algorithms for variants of the Stable Matching Problem. [Masters Thesis]. California State University – Northridge; 2020. Available from: http://hdl.handle.net/10211.3/216431


Université Paris-Sud – Paris XI

10. Zeitoun, Xavier. Complexité des dynamiques de jeux : Complexity of games dynamics.

Degree: Docteur es, Informatique, 2013, Université Paris-Sud – Paris XI

La th´eorie de la complexit´e permet de classifier les probl`emes en fonction de leur difficult´e. Le cadre classique dans lequel elle s’applique est celui d’un… (more)

Subjects/Keywords: Complexité; Equilibre de Nash; Dynamique; Jeux de congestion; Couplage stable; Complexity; Nash equilibrium; Dynamics; Congestion games; Stable matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zeitoun, X. (2013). Complexité des dynamiques de jeux : Complexity of games dynamics. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112083

Chicago Manual of Style (16th Edition):

Zeitoun, Xavier. “Complexité des dynamiques de jeux : Complexity of games dynamics.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed September 18, 2020. http://www.theses.fr/2013PA112083.

MLA Handbook (7th Edition):

Zeitoun, Xavier. “Complexité des dynamiques de jeux : Complexity of games dynamics.” 2013. Web. 18 Sep 2020.

Vancouver:

Zeitoun X. Complexité des dynamiques de jeux : Complexity of games dynamics. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2020 Sep 18]. Available from: http://www.theses.fr/2013PA112083.

Council of Science Editors:

Zeitoun X. Complexité des dynamiques de jeux : Complexity of games dynamics. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112083


Clemson University

11. 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 September 18, 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. 18 Sep 2020.

Vancouver:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Internet] [Doctoral dissertation]. Clemson University; 2010. [cited 2020 Sep 18]. 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

12. 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

…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… …stable ride-share matching in a variety of settings, and develop approaches for finding stable… …similar to that of the stable marriage problem. We develop notions of stable ride-share matching… 

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 September 18, 2020. http://hdl.handle.net/1853/47668.

MLA Handbook (7th Edition):

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

Vancouver:

Wang X. Optimizing ride matches for dynamic ride-sharing systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Sep 18]. 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


University of Illinois – Urbana-Champaign

13. Kulkarni, Chinmay Sanjay. Sharing economy-based on-demand peer-to-peer tutoring and resource sharing.

Degree: MS, Computer Science, 2016, University of Illinois – Urbana-Champaign

 The sharing economy is a socio-economic ecosystem built around the sharing of human and physical resources. This is considered to be a new and alternate… (more)

Subjects/Keywords: Sharing Economy; Incentive Models; Game Theory; Stable Matching; Machine Learning; Data Mining; Social Network Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kulkarni, C. S. (2016). Sharing economy-based on-demand peer-to-peer tutoring and resource sharing. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92958

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):

Kulkarni, Chinmay Sanjay. “Sharing economy-based on-demand peer-to-peer tutoring and resource sharing.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed September 18, 2020. http://hdl.handle.net/2142/92958.

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

MLA Handbook (7th Edition):

Kulkarni, Chinmay Sanjay. “Sharing economy-based on-demand peer-to-peer tutoring and resource sharing.” 2016. Web. 18 Sep 2020.

Vancouver:

Kulkarni CS. Sharing economy-based on-demand peer-to-peer tutoring and resource sharing. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/2142/92958.

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

Council of Science Editors:

Kulkarni CS. Sharing economy-based on-demand peer-to-peer tutoring and resource sharing. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92958

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

14. Toth, William Justin. Structure in Stable Matching Problems.

Degree: 2016, University of Waterloo

 In this thesis we provide two contributions to the study of structure in stable matching problems. The first contribution is a short new proof for… (more)

Subjects/Keywords: Stable Matching; Iterative Rounding; Combinatorial Optimization

…The pair (Chad, Carly) will appear in any stable matching since they are each… …a stable matching problem. In particular the model with two sides and strict preferences… …admissions [18]. Formally stable marriage asks for a matching in a bipartite graph such… …they could hope for in any stable matching. A major landmark in stable marriage was the work… …members of one side of the market like the first stable matching at least as well as the second… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Toth, W. J. (2016). Structure in Stable Matching Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11099

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):

Toth, William Justin. “Structure in Stable Matching Problems.” 2016. Thesis, University of Waterloo. Accessed September 18, 2020. http://hdl.handle.net/10012/11099.

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

MLA Handbook (7th Edition):

Toth, William Justin. “Structure in Stable Matching Problems.” 2016. Web. 18 Sep 2020.

Vancouver:

Toth WJ. Structure in Stable Matching Problems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10012/11099.

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

Council of Science Editors:

Toth WJ. Structure in Stable Matching Problems. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/11099

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

15. 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 September 18, 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. 18 Sep 2020.

Vancouver:

Damianidis I. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. [Internet] [Thesis]. University of Borås; 2011. [cited 2020 Sep 18]. 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


Clemson University

16. 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 September 18, 2020. https://tigerprints.clemson.edu/all_theses/193.

MLA Handbook (7th Edition):

Munshi, Siddharth. “FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS.” 2007. Web. 18 Sep 2020.

Vancouver:

Munshi S. FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS. [Internet] [Masters thesis]. Clemson University; 2007. [cited 2020 Sep 18]. 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

17. Farczadi, Linda. Matchings and games on networks.

Degree: 2015, University of Waterloo

 We investigate computational aspects of popular solution concepts for different models of network games. In chapter 3 we study balanced solutions for network bargaining games… (more)

Subjects/Keywords: cooperative game theory; matching games; stable matchings

…SMG instance with no stable matching . . . . . . . . . . . . . . . . . . 12 1.7 A… …Stable matchings The Stable Marriage (SM) problem is a classical bipartite matching… …stable matching between the men and women, meaning that there is no (man, woman) pair… …woman c2 . In the figure on the left the red edges b1 c1 and b2 c2 denote a stable matching of… …size two, while in the figure on the right the red edge b2 c1 denotes a stable matching of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farczadi, L. (2015). Matchings and games on networks. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9548

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):

Farczadi, Linda. “Matchings and games on networks.” 2015. Thesis, University of Waterloo. Accessed September 18, 2020. http://hdl.handle.net/10012/9548.

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

MLA Handbook (7th Edition):

Farczadi, Linda. “Matchings and games on networks.” 2015. Web. 18 Sep 2020.

Vancouver:

Farczadi L. Matchings and games on networks. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10012/9548.

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

Council of Science Editors:

Farczadi L. Matchings and games on networks. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9548

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

18. 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

…packing. Finally, in Chapter 4, we study a generalization of the Stable Matching problem. The… …notion of a Stable Matching, introduced by Gale and Shapley in 1962 [21], considers a… …each person is in exactly one pair. A matching M is stable if there is no man and woman, not… …admits a stable matching. Not only is it always possible to find a stable matching, but Gale… …woman pairs. A matching M is stable if there is no triple (m, w, d), not matched in… 

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 September 18, 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. 18 Sep 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 Sep 18]. 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

19. 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.

Degree: Mestrado, Teoria Econômica, 2005, University of São Paulo

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

Subjects/Keywords: Algoritmo de Gale e Shapley; Gale Shapley algorithm; Game theory; Jogo estratégico; Manipulabilidade; Manipulability; Matching; Matching estável ótimo para os candidatos; Mercados de dois lados; Stable matching; Two-sided matching markets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bardella, F. P. (2005). Alocação de estudantes aos centros de pós-graduação em economia no Brasil: um experimento natural em organização de mercado. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;

Chicago Manual of Style (16th Edition):

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.” 2005. Masters Thesis, University of São Paulo. Accessed September 18, 2020. http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;.

MLA Handbook (7th Edition):

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.” 2005. Web. 18 Sep 2020.

Vancouver:

Bardella FP. Alocação de estudantes aos centros de pós-graduação em economia no Brasil: um experimento natural em organização de mercado. [Internet] [Masters thesis]. University of São Paulo; 2005. [cited 2020 Sep 18]. Available from: http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;.

Council of Science Editors:

Bardella FP. Alocação de estudantes aos centros de pós-graduação em economia no Brasil: um experimento natural em organização de mercado. [Masters Thesis]. University of São Paulo; 2005. Available from: http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;


University of Waterloo

20. Rioux, Caroline. Scarf's Theorem and Applications in Combinatorics.

Degree: 2006, University of Waterloo

 A theorem due to Scarf in 1967 is examined in detail. Several versions of this theorem exist, some which appear at first unrelated. Two versions… (more)

Subjects/Keywords: Scarf's Theorem; Sperner's Lemma; fractional stable matching; strong fractional kernel; rent partitionning; cake cutting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rioux, C. (2006). Scarf's Theorem and Applications in Combinatorics. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2627

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):

Rioux, Caroline. “Scarf's Theorem and Applications in Combinatorics.” 2006. Thesis, University of Waterloo. Accessed September 18, 2020. http://hdl.handle.net/10012/2627.

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

MLA Handbook (7th Edition):

Rioux, Caroline. “Scarf's Theorem and Applications in Combinatorics.” 2006. Web. 18 Sep 2020.

Vancouver:

Rioux C. Scarf's Theorem and Applications in Combinatorics. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10012/2627.

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

Council of Science Editors:

Rioux C. Scarf's Theorem and Applications in Combinatorics. [Thesis]. University of Waterloo; 2006. Available from: http://hdl.handle.net/10012/2627

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

21. Schneider, Stefan. Fine-Grained Connections Between Exponential and Polynomial Time.

Degree: Computer Science, 2017, University of California – San Diego

 This dissertation presents several results in fine-grained complexity. Fine-grained complexity aims at extending traditional complexity theory by making more precise, and fine-grained, statements on the… (more)

Subjects/Keywords: Computer science; Dynamic Programming; Fine-Grained Complexity; Satisfiability; Stable Matching; Strong Exponential Time Hypothesis

…from maximum inner product to verifying a stable matching… …their top choice in the stable matching… …the stable matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102… …stable matching.” In International Computer Science Symposium in Russia, pp. 294-308. Springer… …Schneider. “Subquadratic Algorithms for Succinct Stable Matching.” ix arXiv preprint arXiv… 

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):

Schneider, S. (2017). Fine-Grained Connections Between Exponential and Polynomial Time. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/3rs5v3nc

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):

Schneider, Stefan. “Fine-Grained Connections Between Exponential and Polynomial Time.” 2017. Thesis, University of California – San Diego. Accessed September 18, 2020. http://www.escholarship.org/uc/item/3rs5v3nc.

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

MLA Handbook (7th Edition):

Schneider, Stefan. “Fine-Grained Connections Between Exponential and Polynomial Time.” 2017. Web. 18 Sep 2020.

Vancouver:

Schneider S. Fine-Grained Connections Between Exponential and Polynomial Time. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2020 Sep 18]. Available from: http://www.escholarship.org/uc/item/3rs5v3nc.

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

Council of Science Editors:

Schneider S. Fine-Grained Connections Between Exponential and Polynomial Time. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/3rs5v3nc

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

22. Hasan, Monowar. Radio Resource Management for Relay-Aided Device-to-Device Communication.

Degree: Electrical and Computer Engineering, 2013, University of Manitoba

 In this thesis, performance of relay-assisted Device-to-device (D2D) communication is investigated where D2D traffic is carried through relay nodes. I develop resource management schemes to… (more)

Subjects/Keywords: D2D; Resource Allocation; Wireless Communication; Message Passing; Stable Matching; Uncertainty; Robust Optimization

…5 Distributed Resource Allocation Under Channel Uncertainties: Stable Matching Approach… …68 69 Convergence of Stable Matching Algorithm . . . . . . . . . . . . . . . Performance… …Comparison of Stable Matching Algorithm . . . . . . . . Gain in Average Data rate vs. Distance… …Between D2D Peers for the Stable Matching Algorithm… …on Rate Gain for the Stable Matching Algorithm 92 94 3.5 3.6 3.7 3.8 4.1 4.2 4.3 4.4 4.5… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hasan, M. (2013). Radio Resource Management for Relay-Aided Device-to-Device Communication. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/30531

Chicago Manual of Style (16th Edition):

Hasan, Monowar. “Radio Resource Management for Relay-Aided Device-to-Device Communication.” 2013. Masters Thesis, University of Manitoba. Accessed September 18, 2020. http://hdl.handle.net/1993/30531.

MLA Handbook (7th Edition):

Hasan, Monowar. “Radio Resource Management for Relay-Aided Device-to-Device Communication.” 2013. Web. 18 Sep 2020.

Vancouver:

Hasan M. Radio Resource Management for Relay-Aided Device-to-Device Communication. [Internet] [Masters thesis]. University of Manitoba; 2013. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1993/30531.

Council of Science Editors:

Hasan M. Radio Resource Management for Relay-Aided Device-to-Device Communication. [Masters Thesis]. University of Manitoba; 2013. Available from: http://hdl.handle.net/1993/30531


Northeastern University

23. Rezvanian, Tina. Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness.

Degree: PhD, Department of Mechanical and Industrial Engineering, 2019, Northeastern University

 This dissertation investigates the advantages of optimization and machine learning algorithms to characterize, predict, and solve Response Planning and Preparedness problems in large-scale humanitarian organizations.… (more)

Subjects/Keywords: cycle based algorithm for stable matching with negotiations on multiple periods; data science machine learning optimization; supply chain network configuration; two-part support vector machine and Gamma Regression; two stage stochastic facility location; zero-inflated skewed variables; Industrial engineering; Operations research; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rezvanian, T. (2019). Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20328704

Chicago Manual of Style (16th Edition):

Rezvanian, Tina. “Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness.” 2019. Doctoral Dissertation, Northeastern University. Accessed September 18, 2020. http://hdl.handle.net/2047/D20328704.

MLA Handbook (7th Edition):

Rezvanian, Tina. “Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness.” 2019. Web. 18 Sep 2020.

Vancouver:

Rezvanian T. Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness. [Internet] [Doctoral dissertation]. Northeastern University; 2019. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/2047/D20328704.

Council of Science Editors:

Rezvanian T. Integrating Data-driven Forecasting And Large-scale Optimization To Improve Humanitarian Response Planning And Preparedness. [Doctoral Dissertation]. Northeastern University; 2019. Available from: http://hdl.handle.net/2047/D20328704

24. Xu, Hong. Efficient Workload and Resource Management in Datacenters.

Degree: 2013, University of Toronto

This dissertation focuses on developing algorithms and systems to improve the efficiency of operating mega datacenters with hundreds of thousands of servers. In particular, it… (more)

Subjects/Keywords: Data centers; Cloud computing; Request mapping; Optimization; VM placement; ADMM; Cooling efficiency; Stable matching; 0984; 0544

…5.2.1 A Primer on Stable Matching . . . . . . . . . . . . . . . . . . . . 86 5.2.2 Models… …Job-Machine Stable Matching . . . . . . . . . . 89 5.3.1 Non-existence of Strongly Stable… …92 5.3.3 Optimal Weakly Stable Matching . . . . . . . . . . . . . . . . . . 93 A New… …Theory of Job-Machine Stable Matching . . . . . . . . . . . . . . 94 5.4.1 A Revised DA… …5.2 A simple example where there is no strongly stable matching. Recall that p()… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, H. (2013). Efficient Workload and Resource Management in Datacenters. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/36071

Chicago Manual of Style (16th Edition):

Xu, Hong. “Efficient Workload and Resource Management in Datacenters.” 2013. Doctoral Dissertation, University of Toronto. Accessed September 18, 2020. http://hdl.handle.net/1807/36071.

MLA Handbook (7th Edition):

Xu, Hong. “Efficient Workload and Resource Management in Datacenters.” 2013. Web. 18 Sep 2020.

Vancouver:

Xu H. Efficient Workload and Resource Management in Datacenters. [Internet] [Doctoral dissertation]. University of Toronto; 2013. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1807/36071.

Council of Science Editors:

Xu H. Efficient Workload and Resource Management in Datacenters. [Doctoral Dissertation]. University of Toronto; 2013. Available from: http://hdl.handle.net/1807/36071

25. Li, Zihao. Allocating resources to people with preferences.

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

 Allocating Resources to People with Preferences Zihao Li 157 Pages Directed by Dr. Julie Swann Resource allocation can be viewed as the assignment of available… (more)

Subjects/Keywords: health services research; health access; vaccine allocation; public health policy; stable matching

…4.1 Notation, input and decision variables in the multi-period stable matching formulation… …comes from the stable matching model studied by Gale and Shapley [2]. In a single… …period, a matching is stable when any worker-job pair does not have unilateral incentive to… …The stable matching concept is widely used 3 because of its elegant theory and… …incidence, and decrease inventory of wasted vaccine. Chapter IV introduces modeling for stable… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2017). Allocating resources to people with preferences. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58704

Chicago Manual of Style (16th Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Doctoral Dissertation, Georgia Tech. Accessed September 18, 2020. http://hdl.handle.net/1853/58704.

MLA Handbook (7th Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Web. 18 Sep 2020.

Vancouver:

Li Z. Allocating resources to people with preferences. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1853/58704.

Council of Science Editors:

Li Z. Allocating resources to people with preferences. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58704

26. Kafer, Sean. On The Circuit Diameters of Some Combinatorial Polytopes.

Degree: 2017, University of Waterloo

 The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the… (more)

Subjects/Keywords: Circuit Diameter; Hirsch Conjecture; Circuit Hirsch Conjecture; Traveling Salesman Polytope; Matching Polytope; Perfect Matching Polytope; Polytope Formulations; Fractional Stable Set Polytope; Combinatorial Diameter; Spanning Tree Polytope; Matroid Polytope

…Transportation and Network Flow polytopes [2, 3, 4, 6, 8], Matching polytopes [3, 10… …this thesis, we study the circuit diameter of the Matching polytope, the Perfect Matching… …polytope, the TSP polytope, and the Fractional Stable Set polytope. Our first result is an exact… …characterization of the circuit diameter of the Matching polytope (resp., Perfect Matching polytope… …combinatorial diameter of the Matching polytope equals b n2 c [3, 10]. In Section 3.1, we… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kafer, S. (2017). On The Circuit Diameters of Some Combinatorial Polytopes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12413

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):

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Thesis, University of Waterloo. Accessed September 18, 2020. http://hdl.handle.net/10012/12413.

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

MLA Handbook (7th Edition):

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Web. 18 Sep 2020.

Vancouver:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10012/12413.

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

Council of Science Editors:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12413

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

.