Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Stable Matching)`

.
Showing records 1 – 21 of
21 total matches.

▼ Search Limiters

Georgia Tech

1.
Mai, Tung.
Distributive lattices, *stable* matchings, and robust solutions.

Degree: PhD, Computer Science, 2018, Georgia Tech

URL: http://hdl.handle.net/1853/60238

► 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

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Mai, Tung. “Distributive lattices, stable matchings, and robust solutions.” 2018. Web. 06 Dec 2019.

Vancouver:

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

Clemson University

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

Degree: PhD, Computer Science, 2010, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/664

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Dabney, John. “Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.” 2010. Web. 06 Dec 2019.

Vancouver:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Internet] [Doctoral dissertation]. Clemson University; 2010. [cited 2019 Dec 06]. 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 Illinois – Urbana-Champaign

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

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

URL: http://hdl.handle.net/2142/97294

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Web. 06 Dec 2019.

Vancouver:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Dec 06]. 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

Georgia Tech

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

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

URL: http://hdl.handle.net/1853/52332

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Soldner, Mallory. “Optimization and measurement in humanitarian operations: addressing practical needs.” 2014. Web. 06 Dec 2019.

Vancouver:

Soldner M. Optimization and measurement in humanitarian operations: addressing practical needs. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Dec 06]. 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 California – San Diego

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

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

URL: http://www.escholarship.org/uc/item/6f80v7jc

► *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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Thesis, University of California – San Diego. Accessed December 06, 2019. 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 (7^{th} Edition):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Web. 06 Dec 2019.

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Washington

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

Degree: PhD, 2017, University of Washington

URL: http://hdl.handle.net/1773/40243

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Levy, Avi William. “Novel uses of the Mallows model in coloring and matching.” 2017. Web. 06 Dec 2019.

Vancouver:

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

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

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

URL: http://hdl.handle.net/1853/47668

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Wang, Xing. “Optimizing ride matches for dynamic ride-sharing systems.” 2013. Web. 06 Dec 2019.

Vancouver:

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

Université Paris-Sud – Paris XI

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

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

URL: http://www.theses.fr/2013PA112083

►

La th´eorie de la complexit´e permet de classiﬁer les probl`emes en fonction de leur diﬃcult´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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Zeitoun, Xavier. “Complexité des dynamiques de jeux : Complexity of games dynamics.” 2013. Web. 06 Dec 2019.

Vancouver:

Zeitoun X. Complexité des dynamiques de jeux : Complexity of games dynamics. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2019 Dec 06]. 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

University of Western Australia

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

Degree: PhD, 2008, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=6124&local_base=GEN01-INS01

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Schweizer, Andreas. “Analysis and optimisation of stable matching in combined input and output queued switches.” 2008. Web. 06 Dec 2019.

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 2019 Dec 06]. 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 California – San Diego

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

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

URL: http://www.escholarship.org/uc/item/3rs5v3nc

► 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

Record Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schneider, Stefan. “Fine-Grained Connections Between Exponential and Polynomial Time.” 2017. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

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

URL: http://hdl.handle.net/2142/92958

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kulkarni, Chinmay Sanjay. “Sharing economy-based on-demand peer-to-peer tutoring and resource sharing.” 2016. Web. 06 Dec 2019.

Vancouver:

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

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

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

URL: https://tigerprints.clemson.edu/all_theses/193

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Munshi, Siddharth. “FASTER ALGORITHMS FOR STABLE ALLOCATION PROBLEMS.” 2007. Web. 06 Dec 2019.

Vancouver:

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

URL: http://hdl.handle.net/10500/778

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Web. 06 Dec 2019.

Vancouver:

Philpin EM. Stable matching in preference relationships . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2019 Dec 06]. 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.
Toth, William Justin.
Structure in *Stable* *Matching* Problems.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/11099

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Toth, William Justin. “Structure in Stable Matching Problems.” 2016. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9548

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Farczadi, Linda. “Matchings and games on networks.” 2015. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401

►

“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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Damianidis, Ioannis. “The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.” 2011. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

URL: http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 December 06, 2019. http://www.teses.usp.br/teses/disponiveis/12/12138/tde-09012007-171704/ ;.

MLA Handbook (7^{th} 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. 06 Dec 2019.

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 2019 Dec 06]. 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/ ;

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

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

URL: http://hdl.handle.net/1853/58704

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Web. 06 Dec 2019.

Vancouver:

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

University of Waterloo

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

Degree: 2006, University of Waterloo

URL: http://hdl.handle.net/10012/2627

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rioux, Caroline. “Scarf's Theorem and Applications in Combinatorics.” 2006. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://hdl.handle.net/1993/30531

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Hasan, Monowar. “Radio Resource Management for Relay-Aided Device-to-Device Communication.” 2013. Web. 06 Dec 2019.

Vancouver:

Hasan M. Radio Resource Management for Relay-Aided Device-to-Device Communication. [Internet] [Masters thesis]. University of Manitoba; 2013. [cited 2019 Dec 06]. 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

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

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12413

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Web. 06 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation