A page on LabLog, a review site (not the lab's official page)
Yokoi Lab
Machine-translated · View original
A lab studying discrete algorithms that achieve optimality and fairness.

AboutAbout the lab
Discrete algorithms for optimality and fairness
Yokoi Lab studies discrete mathematics and algorithms.
It deals with problems on graphs and sets, and matching problems in which participants have ranked preferences.
The lab aims to design algorithms that achieve optimality and fairness for such problems.
Its members are interested in combinatorial optimization, matroid theory, stable matching, game theory, and mathematical economics.
Key terms
- Combinatorial optimization
- The problem of choosing the best option that satisfies the conditions from among a large number of combinations
- Stable matching
- Pairing two groups whose members have ranked preferences so that no participants would want to break away from their assigned partners
- Algorithm
- A set of procedures and computational rules for having a computer carry out a task
ResearchResearch themes
The lab studies discrete mathematics and algorithms. It aims to design algorithms that achieve optimality and fairness for problems on graphs and sets, and for matching problems with preferences.
*Illustrative imageFair and Stable Matching
When pairing parties who have preferences for each other, such as students and labs or hospitals and residents, the challenge is how to balance stability and fairness. The lab uses algorithms to find assignments that are fair to both sides and ways to reduce differences in satisfaction.
*Illustrative imageFairly Dividing Indivisible Items
When several people share a single item, adjusting the probabilities in a lottery can sometimes produce a division in which no one envies anyone else. The lab studies how to think about fairness in probabilistic assignments and how to achieve it.
*Illustrative imageFinding Colored Trees
When the edges of a graph are colored, a conjecture asks whether a "rainbow" directed tree (arborescence) that uses each color exactly once can be found. By working on problems of combinatorial structure, such as proving this conjecture in special cases, the lab deepens the theory of algorithms.
MembersFaculty
The members of Yokoi Lab include faculty and master's and bachelor's students.
- Associate ProfessorYu YokoiPublications ↗
VoicesStudent voices
Ratings and reviews reflect the experiences of individual current or former students, not the lab's official views. Whether a lab has reviews, or how many, says nothing about the lab itself.
Students who take part in an interview may receive a thank-you gift worth ¥1,000, regardless of what they say.
Student ratings (0 students)
--
--
--
--
--
--
Student voices answer questions like these
- What's great about this lab?
- What did you learn after joining?
- What's the vibe, and what is the professor like?
- Who is this lab for?
- Where do graduates go?
Your experience can help younger students choose their lab. Your name won't be shown.
Write a lab reviewAnonymous · Your draft is saved if you stopRelatedLabs similar to Yokoi Lab
Sumita LabSchool of Computing, Department of Mathematical and Computing ScienceDesign of combinatorial optimization algorithms
Yamashita LabSchool of Computing, Department of Mathematical and Computing ScienceDeriving Optimal Solutions to Real-World Problems through Ma…
Fujisawa LabSchool of Computing, Department of Mathematical and Computing ScienceRealization of a super-smart society through AI and mathemat…
Nanashima LabSchool of Computing, Department of Mathematical and Computing ScienceComputational complexity theory, learning, and cryptography …The information on this page is compiled by the LabLog team from the lab's public information and interviews. For corrections or removal requests, please contact LabLog, not the lab.
Report an errorAbout the images
The top and research theme images are illustrative and were not taken at the lab. They are cropped from Wikimedia Commons images. Cropped CC BY-SA images are provided under the same CC BY-SA license as the original (version shown on each line).
- Top image: “Barabasi Albert 1000nodes” Keiichiro Ono / CC BY-SA 2.5 (cropped)
- Fair and Stable Matching: “College fair at Misawa Air Base, Japan's Robert Edgren High School 150416-N-EC644-068” Senior Chief Petty Officer Ryan Delcore / Public domain (cropped)
- Fairly Dividing Indivisible Items: “Lottery drum (tambiolo)” Betsy Weber / CC BY 2.0 (cropped)
- Finding Colored Trees: “Bicolored path, Misra and Gries edge coloring algorithm” lucasr.mal / CC BY-SA 4.0 (cropped)
- Related lab (澄田範奈研究室): “Infeasible bipartite graph” Jj lipski / CC0 (cropped)
- Related lab (山下真研究室): “Rosenbrock function 2” RokerHRO / Public domain (cropped)
- Related lab (藤澤克樹研究室): “Automated Storage and Retrieval System” QmcBeQ3G7DZCmY84uPgT / CC BY 4.0 (cropped)
- Related lab (七島幹人研究室): “Turing Machine Model Davey 2012” Rocky Acosta / CC BY 3.0 (cropped)
About LabLog
LabLog is a lab review app for students only. Student members at each university interview students in labs and publish what they say. Student voices can only be read by students who sign up with a university email address. Operated by bestiee Inc.
Learn more about LabLog ↗Search engines and AI may reference the basic lab info and rating summaries on this page and the description of LabLog. Student voices are for student members only. Automated collection by programs (scraping, or input to or training of AI) is prohibited under Article 8 of the Terms of Service. If you need data for research or analysis, please contact us.