Search references for STABLE MATCHING-PROBLEM. Phrases containing STABLE MATCHING-PROBLEM
See searches and references containing STABLE MATCHING-PROBLEM!STABLE MATCHING-PROBLEM
Pairing where no unchosen pair prefers each other over their choice
mathematics, economics, and computer science, the stable matching problem is the problem of finding a stable matching between two equally sized sets of elements
Stable_matching_problem
In the theory of matching markets, an optimal stable matching is a matching that, among all stable matchings, satisfies some criterion of optimality.
Optimal_stable_matching
Type of stable matching problem
and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching for an even-sized set. A matching is a separation of the
Stable_roommates_problem
Set of edges without common vertices
of which are adjacent to each other Stable marriage problem (also known as stable matching problem) "is_matching". NetworkX 2.8.2 documentation. Retrieved
Matching_(graph_theory)
the stable matching polytope or stable marriage polytope is a convex polytope derived from the solutions to an instance of the stable matching problem. The
Stable_matching_polytope
Algebra whose elements are stable matchings
lattice of stable matchings is a distributive lattice whose elements are all the solutions to a given instance of the stable matching problem. These solutions
Lattice_of_stable_matchings
Procedure for finding a stable matching
Pool algorithm) is an algorithm for finding a solution to the stable matching problem. It is named for David Gale and Lloyd Shapley, who published it
Gale–Shapley_algorithm
Field of market economics
students matching with colleges). A smaller literature considers other types of matching, such as one-sided matching (e.g. the stable roommates problem) and
Matching_markets
US non-profit that matches medical students with teaching hospitals
actual matches has been minimal. Matching applicants to programs is a generalization of the stable marriage problem; as a result, the solutions are very
National Resident Matching Program
National_Resident_Matching_Program
Combinatorial optimization problem
Resident Matching Program Quadratic assignment problem Rank-maximal allocation Secretary problem Stable matching problem Stable roommates problem Weapon-target
Assignment_problem
Economics book
National Resident Matching Program and its use of stable marriage to assign medical students to hospital positions, and collects the problems in economics
Two-Sided_Matching
Graph theory problem
Maximum-weight matching is an optimization problem in graph theory in which the goal is to find a matching of maximum possible total weight in an edge-weighted
Maximum-weight_matching
Topics referred to by the same term
sultan's dowry or best choice problem, in optimal stopping theory Stable marriage problem, the problem of finding a stable matching between two equally sized
Marriage_problem
Topics referred to by the same term
Look up matching in Wiktionary, the free dictionary. Matching may refer to: Matching, Essex, England Matching Green Matching Tye Matching (graph theory)
Matching
matching; this is known as the woman-optimal stable matching. The decision version of the stable matching problem is, given the rankings of all men and women
CC_(complexity)
Variant of the stable marriage problem
super-stable matching else no strongly stable matching exists In many problems, there can be several different stable matchings. The set of stable matchings
Stable marriage with indifference
Stable_marriage_with_indifference
American computer scientist and mathematician (born 1938)
Knuth has made a substantial contribution to the study of the Stable matching problem. In addition to his writings on computer science, Knuth, a Lutheran
Donald_Knuth
Unrelated vertices in graphs
found in polynomial time using a bipartite matching algorithm. In general, the maximum independent set problem cannot be approximated to a constant factor
Independent set (graph theory)
Independent_set_(graph_theory)
in function value iterations Gale–Shapley algorithm: solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also
List_of_algorithms
In a many-to-one matching problem, stable matchings exist and can be found by the Gale–Shapley algorithm. Therefore, NJE matchings exist too. In general
No-justified-envy_matching
Mathematical problem involving optimal stopping theory
to Secretary problem. Assignment problem Odds algorithm Optimal stopping Robbins' problem Satisficing Search theory Stable marriage problem Exploration–exploitation
Secretary_problem
(RHT) is a fundamental theorem in the theory of stable matching. It considers the problem of matching doctors to hospitals for residency, where each doctor
Rural_hospitals_theorem
Class of computational problems
searching for matchings, optional cliques, and stable sets in a given undirected graph. An algorithm is said to solve a search problem if, for every input
Search_problem
Theory in matching markets
minimum total cost (this problem is analogous to the problem of optimal stable matching, where the goal is to find a stable matching of miniumum cost). The
Popular_matching
hedonic games are given by matching problems, such as the stable marriage, stable roommates, and the hospital/residents problems. The players in hedonic
Hedonic_game
Matchmaking activity on U.S. college campuses
in life. The stable marriage problem, and human matching more generally, is a problem of allocation. Unlike marketplaces, where problems are solved by
Marriage_Pact
Solution concept in game theory
An evolutionarily stable strategy (ESS) is a strategy (or set of strategies) that is impermeable when adopted by a population in adaptation to a specific
Evolutionarily stable strategy
Evolutionarily_stable_strategy
conjecture relating the maximum matching size and minimum transversal size in hypergraphs The second neighborhood problem: does every oriented graph contain
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Rule for fair division of invisible items
task has to be done by a single person), the problem is called rank-maximal matching or greedy matching. The idea is similar to that of utilitarian cake-cutting
Rank-maximal_allocation
Graph divided into two independent sets
problems on matchings, including maximum matching (finding a matching that uses as many edges as possible), maximum-weight matching, and stable marriage
Bipartite_graph
Simple game studied in game theory
Matching pennies is a non-cooperative game studied in game theory. It is played between two players, Even and Odd. Each player has a penny and must secretly
Matching_pennies
American economist (born 1951)
"real-world" problems. In 2012, he won the Nobel Memorial Prize in Economic Sciences jointly with Lloyd Shapley "for the theory of stable allocations and
Alvin_E._Roth
Methodology for creation of markets
Milgrom, 2005), he shows how to generalize the stable marriage matching problem to allow for “matching with contracts”, where the terms of the match between
Market_design
Simultaneous game found in game theory
standard) is a typical solution to a coordination problem. The choice of a voluntary standard tends to be stable in situations in which all parties can realize
Coordination_game
Shape representing matchings in a graph
having a perfect matching. By solving algorithmic problems on convex sets, one can find a minimum-weight perfect matching. Stable matching polytope Lovász
Matching_polytope
Form of plane tiling without repeats at scale
Smith is an aperiodic monotile, i.e., a solution to the einstein problem, a problem that seeks the existence of any single shape aperiodic tile. In May
Aperiodic_tiling
Feature detection algorithm in computer vision
localized key points. These steps ensure that the key points are more stable for matching and recognition. SIFT descriptors robust to local affine distortion
Scale-invariant feature transform
Scale-invariant_feature_transform
Model of conflict for two players in game theory
Fireship, a naval tactic of intentional suicidal ramming into an enemy ship Matching pennies Mexican standoff Prisoner's dilemma Ritualized aggression Si vis
Chicken_(game)
Problem in game theory
The El Farol bar problem is a problem in game theory. Every Thursday night, a fixed population want to go have fun at the El Farol Bar, unless it's too
El_Farol_Bar_problem
Condition where selection restores genetic composition
A population can be described as being in an evolutionarily stable state when that population's "genetic composition is restored by selection after a disturbance
Evolutionarily_stable_state
Solution concept of a non-cooperative game
football (i.e., soccer; see matching pennies), robot navigation in crowds, energy systems, transportation systems, evacuation problems and wireless communications
Nash_equilibrium
Square tiles with a color on each edge
tiles is selected, and copies of the tiles are arranged side by side with matching colors, without rotating or reflecting them. The basic question about a
Wang_tile
"Deadlock". GameTheory.net. Retrieved September 30, 2006. Shor, Mikhael. "Matching Pennies". GameTheory.net. Retrieved September 30, 2006. Shor, Mikhael.
List_of_games_in_game_theory
Graph without four-vertex star subgraphs
of Claw-free Graphs Leading to an O(n3)-algorithm for the Weighted Stable Set Problem", Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete
Claw-free_graph
terms are assignment problem and one-sided matching. When agents already own houses (and may trade them with other agents), the problem is often called a
House_allocation_problem
Logical paradox in decision-making theory
Studies: An Irish Quarterly Review, 86(344), 346–359. http://www.jstor.org/stable/30091841 Blumner, Robyn E. (August–September 2016). "Is My Intolerance of
Paradox_of_tolerance
English saying meaning "equivalent retaliation"
well. Ultimately, each action by the other member is countered with a matching response, competition with competition and cooperation with cooperation
Tit_for_tat
Standard example in game theory
that unfair ZD strategies are not evolutionarily stable. The key intuition is that an evolutionarily stable strategy must not only be able to invade another
Prisoner's_dilemma
School admissions algorithm
School choice is a kind of a two-sided matching market, like the stable marriage problem or residency matching. The main difference is that, in school
School-choice_mechanism
Study of optimal transportation and allocation of resources
transportation problem is an instance of the assignment problem. More specifically, it is equivalent to finding a minimum weight matching in a bipartite
Transportation theory (mathematics)
Transportation_theory_(mathematics)
Mathematical problem solving strategy
equations are the matching conditions, and the first and last equations are the conditions y(ta) = ya and y(tb) = yb from the boundary value problem. The multiple
Direct multiple shooting method
Direct_multiple_shooting_method
Game theory model of aggression
was originally formulated by John Maynard Smith; a mixed evolutionarily stable strategy (ESS) was determined by Bishop & Cannings. An example is a second
War_of_attrition_(game)
financial networks Fractional stable paths problems Fractional hypergraph matching (see also the NP-complete Hypergraph matching) Fractional strong kernel
List of PPAD-complete problems
List_of_PPAD-complete_problems
Hungarian and American mathematician and physicist (1903–1957)
Uchaikin, Vladimir V.; Zolotarev, Vladimir M. (1999). Chance and Stability: Stable Distributions and their Applications. De Gruyter. pp. xviii, 281, 424. doi:10
John_von_Neumann
Decision rule used for minimizing the possible loss for a worst-case scenario
worst possible result is then no payment. However, this solution is not stable, since if B believes A will choose A2 then B will choose B1 to gain 1; then
Minimax
Concept in game theory
intervals for finite samples can be obtained via the wild bootstrap. Airport problem Banzhaf power index Shapley–Shubik power index Shapley, Lloyd S. (August
Shapley_value
Overuse of a shared resource
Secretary-General of the United Nations In addition, Hardin also pointed out the problem of individuals acting in rational self-interest by claiming that if all
Tragedy_of_the_commons
Process of reasoning backwards in sequence
determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.
Backward_induction
Situation where total gains match total losses
independent of the opponent's strategy. This leads to a linear programming problem with the optimal strategies for each player. This minimax method can compute
Zero-sum_game
Israeli-American psychologist and economist (1934–2024)
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Daniel_Kahneman
Study of strategic decision making
other words, each agent acts according to his minimization or maximization problem taking into account other agents’ decisions and because their population
Mean-field_game_theory
Problem in game theory
In mathematics and especially game theory, the airport problem is a type of fair division problem in which it is decided how to distribute the cost of an
Airport_problem
Concept in game theory
game Surprisingly popular Equilibrium selection Rendezvous problem, the mathematical problem of maximising the probability of two people meeting Pastin
Focal_point_(game_theory)
Logical dilemma
probability of meeting? Examples of this class of problems are known as rendezvous problems. These problems were first introduced informally by Steve Alpern
Rendezvous_problem
Concept in game theory
logically identical. One well-known game with payoff asymmetries is the matching pennies game. In this game one player, the row player (graphed on the y
Best_response
Condition in economics and game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Perfect_information
Term in game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Move_by_nature
Search algorithm
Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley. ISBN 978-0-201-05594-8. OCLC 1035596197. Fishburn
Alpha–beta_pruning
Model of humans as rational, self-interested agents
discussion. In its standard formulation, the model assumes that individuals have stable preferences, access to relevant information, and seek to maximize utility
Homo_economicus
Solution concept for non-cooperative games
and Player Splitting. The stable sets of the product of two independent games are the products of their stable sets. Stable sets are not affected by splitting
Mertens-stable_equilibrium
Conflict between safety and cooperation
a stag hunt is a game with two pure strategy Nash equilibria, that is, stable attractors where an individual player can't improve their position with
Stag_hunt
Concept in game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Incentive_compatibility
Israeli psychologist (1937–1996)
contrast model feature matching account of similarity Kahneman said that Tversky "had simply perfect taste in choosing problems, and he never wasted much
Amos_Tversky
Mathematical game of resource allocation
CY]. Martin, Layla (2017). "Extending Kolkata Paise Restaurant problem to dynamic matching in mobility markets". Junior Manag. Sci. 4: 1–34. doi:10.5282/jums/v4i1pp1-34
Kolkata Paise Restaurant Problem
Kolkata_Paise_Restaurant_Problem
Process of matching two or more people together, usually for the purpose of marriage
market Matrimonial website Stable marriage problem The old man under the moon: fabled Chinese matchmaker Pattern matching Novertur: Business matchmaking
Matchmaking
Weakly optimal allocation of resources
water content Social Choice and Individual Values by Kenneth Arrow Stable marriage problem Trade-off talking rational economic person (TOTREP) Welfare economics
Pareto_efficiency
Facilitating a peaceful outcome to a dispute
meeting the needs of others and have a general concern for maintaining stable, positive social relationships. When faced with conflict, individuals with
Conflict_resolution
Problem in process of sharing surplus
which division of payoffs to choose. Such surplus-sharing problems (also called bargaining problem) are faced by management and labor in the division of a
Cooperative_bargaining
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Outcome_(game_theory)
Problem about bus travel
a destination by another means, especially walking. Some work on this problem was featured in the 2008 "Year in Ideas" issue of The New York Times Magazine
Wait/walk_dilemma
Concept in game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Non-credible_threat
Game theory scenario
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Win–win_game
experiment showing the benefits of stable matching mechanisms. Diebold and Bichler compare various mechanisms for two-sided matching on course-allocation information
Course_allocation
Particular task in computer vision
for stereo matching. There are close relations between this notion and the above-mentioned notion of grey-level blob tree. The maximally stable extremal
Blob_detection
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Contingent_cooperator
Concept in economics and game theory
driver would benefit by a 15-minute reduction in travel time. The routing problem introduced in the Braess's paradox can be generalized to many different
Price_of_anarchy
Hand game for two players or more
strategies it employs are history matching, frequency analysis, and random guessing. Its strongest strategy, history matching, searches for a sequence in the
Rock_paper_scissors
Subset of a game; used in game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Subgame
Military strategy during the Cold War with regard to the use of nuclear weapons
party to refrain from initiating some other course of action. The central problem of deterrence revolves around how to credibly threaten military action
Deterrence_theory
Enhancement of Alpha–Beta game tree search
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Principal_variation_search
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Complete_mixing
Game where groups of players may enforce cooperative behaviour
unique vector. The core is contained in any stable set, and if the core is stable it is the unique stable set; see (Driessen 1988) for a proof. For simple
Cooperative_game_theory
Concept in conflict studies
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Conflict_escalation
Tendency to overestimate in auctions
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Winner's_curse
Hand game for two or more players
having each of the 15 distinct pairs, and the other player being dead. The problem is that the dead player is the player who just took his turn (hence the
Chopsticks_(hand_game)
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Fictitious_play
Set in game theory
coalition having at least (n+1)/2 members has an empty core. That is, no stable coalition exists. Consider a group of n miners, who have discovered large
Core_(game_theory)
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Transferable_utility
Topics referred to by the same term
system, or for a perfect matching in a bipartite graph The stable marriage theorem, stating that every stable marriage problem has a solution This disambiguation
Marriage_theorem
Variant of Nash equilibrium in game theory
Farol Bar problem Electronic mail game Gift-exchange game Guess 2/3 of the average Keynesian beauty contest Kuhn poker Lewis signaling game Matching pennies
Trembling hand perfect equilibrium
Trembling_hand_perfect_equilibrium
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
Surname or Lastname
English
English : occupational name for someone who looked after horses or cattle, from an agent derivative of Middle English stable ‘stable’.German (Stäbler) : occupational name for an official who carried a staff as a symbol of office, Middle High German stebelære.
Female
English
Feminine variant spelling of English unisex Stacey, STACEE means "resurrection."
Surname or Lastname
English
English : from Middle English stapel ‘post’, hence a topographic name for someone who lived near a boundary post, or a habitational name from some place named with this word (Old English stapel), as for example Staple in Kent or Staple Fitzpaine in Somerset.Americanized spelling of German Stapel.
Female
English
Variant spelling of English Mabel, MABLE means "lovable."Â
Boy/Male
Hindu
Stable
Female
English
English name derived from the vocabulary word, SABLE means "black," as a heraldic color. It is sometimes confused with the mammal of the same name but which has brown fur, not black, and which has a different origin.
Male
French
French name derived from Latin amabilis, AMABLE means "lovable."
Female
English
Feminine variant spelling of English unisex Stacey, STACIE means "resurrection."
Surname or Lastname
English
English : variant of Staple.
Surname or Lastname
English
English : variant spelling of Machen.Spanish (MachÃn) : probably a nickname from machÃn ‘boor’, ‘lout’, often applied to a blacksmith’s apprentice.French : nickname from Old French machin ‘scheming’.
Surname or Lastname
English (Devon and Cornwall)
English (Devon and Cornwall) : habitational name from Scoble in Devon.
Girl/Female
Afghan, Arabic, Bengali, Indian, Kannada, Marathi, Muslim
Like; Equal; Matching
Boy/Male
Vietnamese
Stable.
Boy/Male
Indian, Sanskrit
Stable
Girl/Female
Muslim
Like. Equal. Matching.
Surname or Lastname
English, Dutch, North German, and Danish
English, Dutch, North German, and Danish : variant of Stubbe.
Boy/Male
Shakespearean American English
Henry VI, Part 2' Sir John Stanley. 'King Henry the Sixth, Part III' Sir William Stanley. 'King...
Female
English
Elaborated form of English Star, STARLA means "star."
Surname or Lastname
English
English : topographic name for someone who lived by a stable, or an occupational name for someone employed in one, from Middle English stable, plural stables (via Old French from Latin stabulum, a derivative of stare ‘to stand’). In Middle English the term was used of the quarters occupied by cattle as well as those reserved for horses.
Boy/Male
Tamil
Stable
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
Boy/Male
Hindu, Indian, Punjabi, Sikh
Wish; Deep Inner Desire for Love and Companionship and want to Work with Others to Achieve Peace and Harmony
Boy/Male
Tamil
Karthikesan | கரà¯à®¤à¯€à®•ேஸந
Good looking individuals
Girl/Female
Tamil
Softened
Boy/Male
Arabic, Muslim
Sufficient; Enough
Surname or Lastname
English
English : from Middle English at ther bery ‘at the manor house’, a slightly older form of Atteberry. The -ter- spelling represents a survival into early Middle English of þære, Old English feminine dative of se ‘the’.
Girl/Female
Hindu, Indian, Marathi, Tamil
Quick; Swift
Girl/Female
Arabic, Australian
Garden; Having Good Manners; A Piece of Garden in the Heaven; Vast; Spacious; Open-minded; Generous
Male
English
English surname transferred to forename use, from Old French Aousten, from Roman Latin Augustinus, AUSTIN means "venerable."
Boy/Male
Tamil
Khatvangin | காதà¯à®µà®¨à¯à®•ீந
One who has the missile Khatvangin in his hand
Girl/Female
American, Australian, Basque, Chinese, Danish, Finnish, French, German, Greek, Hebrew, Latin, Swedish
May; Source of the Month May; Goddess of Spring Growth; Great; Pink; White Blossom; Nurse; Goddess of Spring; Close to God; Mother; Great One; Great Mother
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
STABLE MATCHING-PROBLEM
n.
The fur of the sable.
imp. & p. p.
of Stale
v. i.
Durable; not subject to overthrow or change; firm; as, a stable foundation; a stable position.
n.
The company assembled round a table.
v. t.
To form into a table or catalogue; to tabulate; as, to table fines.
imp. & p. p.
of Stable
n.
The fiber of wool, cotton, flax, or the like; as, a coarse staple; a fine staple; a long or short staple.
imp. & p. p.
of Sable
a.
Being of reasonable or suitable size; as, sizable timber; sizable bulk.
adv.
In a stable manner; firmly; fixedly; steadily; as, a government stably settled.
v. t.
To put or keep in a stable.
a.
Approaching maturity; as, maturing fruits; maturing notes of hand.
a.
Pertaining to, or being market of staple for, commodities; as, a staple town.
v. i.
To dwell or lodge in a stable; to dwell in an inclosed place; to kennel.
a.
Liable to, or subjected by law to, taxation; as, ratable estate.
n.
A stable keeper.
a.
Not stable; not standing fast or firm; unstable; prone to change or recede from a purpose; mutable; inconstant.
v. i.
A house, shed, or building, for beasts to lodge and feed in; esp., a building or apartment with stalls, for horses; as, a horse stable; a cow stable.
v. i.
Firmly established; not easily moved, shaken, or overthrown; fixed; as, a stable government.
v. t.
To sort according to its staple; as, to staple cotton.