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

Language: English

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

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

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

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 January 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 Jan 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 Jan 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


University of California – San Diego

2. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Jan 26]. 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

3. 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 January 26, 2020. http://hdl.handle.net/1853/60238.

MLA Handbook (7th Edition):

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

Vancouver:

Mai T. Distributive lattices, stable matchings, and robust solutions. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Jan 26]. 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


Georgia Tech

4. 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 January 26, 2020. http://hdl.handle.net/1853/52332.

MLA Handbook (7th Edition):

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

Vancouver:

Soldner M. Optimization and measurement in humanitarian operations: addressing practical needs. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Jan 26]. 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


University of Washington

5. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Levy AW. Novel uses of the Mallows model in coloring and matching. [Internet] [Doctoral dissertation]. University of Washington; 2017. [cited 2020 Jan 26]. 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

6. 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 January 26, 2020. http://dx.doi.org/10.26153/tsw/5856.

MLA Handbook (7th Edition):

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

Vancouver:

Lam CK. Algorithms for stable matching with indifferences. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2020 Jan 26]. 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 Western Australia

7. Schweizer, Andreas. Analysis and optimisation of stable matching in combined input and output queued switches.

Degree: PhD, 2008, University of Western Australia

Output queues in network switches are known to provide a suitable architecture for scheduling disciplines that need to provide quality of service (QoS) guarantees. However,… (more)

Subjects/Keywords: Computer networks; Markov processes; Matching theory; Switching theory; Telecommunication; Data networks; Stable matching; Markov chain; Switching algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schweizer, A. (2008). Analysis and optimisation of stable matching in combined input and output queued switches. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=6124&local_base=GEN01-INS01

Chicago Manual of Style (16th Edition):

Schweizer, Andreas. “Analysis and optimisation of stable matching in combined input and output queued switches.” 2008. Doctoral Dissertation, University of Western Australia. Accessed January 26, 2020. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=6124&local_base=GEN01-INS01.

MLA Handbook (7th Edition):

Schweizer, Andreas. “Analysis and optimisation of stable matching in combined input and output queued switches.” 2008. Web. 26 Jan 2020.

Vancouver:

Schweizer A. Analysis and optimisation of stable matching in combined input and output queued switches. [Internet] [Doctoral dissertation]. University of Western Australia; 2008. [cited 2020 Jan 26]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=6124&local_base=GEN01-INS01.

Council of Science Editors:

Schweizer A. Analysis and optimisation of stable matching in combined input and output queued switches. [Doctoral Dissertation]. University of Western Australia; 2008. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=6124&local_base=GEN01-INS01


University of Illinois – Urbana-Champaign

8. 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 January 26, 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. 26 Jan 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 Jan 26]. 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


University of South Africa

9. 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 January 26, 2020. http://hdl.handle.net/10500/778.

MLA Handbook (7th Edition):

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

Vancouver:

Philpin EM. Stable matching in preference relationships . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2020 Jan 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

10. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Toth WJ. Structure in Stable Matching Problems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jan 26]. 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

11. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Farczadi L. Matchings and games on networks. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Jan 26]. 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

12. 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 January 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 Jan 2020.

Vancouver:

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


University of Waterloo

13. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Rioux C. Scarf's Theorem and Applications in Combinatorics. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2020 Jan 26]. 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

14. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Schneider S. Fine-Grained Connections Between Exponential and Polynomial Time. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2020 Jan 26]. 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

15. 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 January 26, 2020. http://hdl.handle.net/1853/58704.

MLA Handbook (7th Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Web. 26 Jan 2020.

Vancouver:

Li Z. Allocating resources to people with preferences. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jan 26]. 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

16. 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 January 26, 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. 26 Jan 2020.

Vancouver:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Jan 26]. 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

.