Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Keisuke Bando

dblp:147/9211 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-7973-1142ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Theory of computation · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 87% Mathematical optimization · 9% Combinatorics and discrete mathematics · 5%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
matching
0.912025
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings · EC 2025
Algorithmic game theory and mechanism design › social choice › social choice function
path independence
0.912025
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings · EC 2025
Algorithmic game theory and mechanism design › matching
stable matching
0.912025
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings · EC 2025
Algorithmic game theory and mechanism design › market equilibrium
competitive equilibrium
0.812024
Strategy-proofness and competitive equilibrium with transferable utility: Gross substitutes revisited · EC 2024
Algorithmic game theory and mechanism design › market design › combinatorial markets
gross substitutes
0.812024
Strategy-proofness and competitive equilibrium with transferable utility: Gross substitutes revisited · EC 2024
Algorithmic game theory and mechanism design › market design
matching markets
0.812024
Strategy-proofness and competitive equilibrium with transferable utility: Gross substitutes revisited · EC 2024
Mathematical optimization
discrete optimization
0.312025
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings · EC 2025
Combinatorics and discrete mathematics
matroid
0.312025
Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings · EC 2025

Methods — techniques the papers use, named apart from their topics

utility theory · 0.9matroid theory · 0.9equilibrium analysis · 0.8
YearPublicationVenuePosition
2025 Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
abstract
Choice correspondences are crucial in decision-making, especially when faced with indifferences or ties. While tie-breaking can transform a choice correspondence into a choice function, it often introduces inefficiencies. This paper introduces a novel notion of path-independence (PI) for choice correspondences, extending the existing concept of PI for choice functions. Intuitively, a choice correspondence is PI if any consistent tie-breaking produces a PI choice function. This new notion yields several important properties. First, PI choice correspondences are rationalizabile, meaning they can be represented as the maximization of a utility function. This extends a core feature of PI in choice functions. Second, we demonstrate that the set of choices selected by a PI choice correspondence for any subset forms a generalized matroid. This property reveals that PI choice correspondences exhibit a nice structural property. Third, we establish that choice correspondences rationalized by ordinally concave functions inherently satisfy the PI condition. This aligns with recent findings that a choice function satisfies PI if and only if it can be rationalized by an ordinally concave function.
Keisuke Bando, Kenzo Imamura, Yasushi Kawase
EC1
2024 Strategy-proofness and competitive equilibrium with transferable utility: Gross substitutes revisited
abstract
The existence of competitive equilibria has been extensively studied in many economic models. In the literature of matching theory, attention has been paid to many-to-one matching models. These models consider matching between two types of agents, such as firms and workers, sellers and buyers, hospitals and doctors, or schools and students. In a many-to-one matching model with continuous transfers and quasilinear utilities, the gross substitutes condition (GS), which excludes the complementarity among workers in a firm's valuation, guarantees the existence of competitive equilibria. While GS is known to be a necessary condition in the maximal domain sense, competitive equilibria can exist even if GS is violated. Recent developments in this field have revealed that various conditions other than GS can guarantee the existence of competitive equilibria. For example, under the gross substitutes and complements condition (GSC), competitive equilibria exist even when certain types of complement. The concept of unimodular demand types includes both GS and GSC as special cases.
Kenzo Imamura, Keisuke Bando, Tomoya Kazumura
EC2