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

Haruki Kono

dblp:351/1277 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0001-9253-9764ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 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
1 paper
Algorithmic game theory and mechanism design · 50% Logic in computer science · 25% Computational complexity · 25%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › meta-logic
axiomatization
0.712023
Axiomatization of Random Utility Model with Unobservable Alternatives · EC 2023
Algorithmic game theory and mechanism design
mechanism design
0.712023
Axiomatization of Random Utility Model with Unobservable Alternatives · EC 2023
Algorithmic game theory and mechanism design › decision theory
random utility model
0.712023
Axiomatization of Random Utility Model with Unobservable Alternatives · EC 2023

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

block-marschak polynomial · 0.7
YearPublicationVenuePosition
2023 Axiomatization of Random Utility Model with Unobservable Alternatives
abstract
The random utility model is one of the most fundamental models in discrete choice analysis in economics. Although Falmagne (1978) obtained an axiomatization of the random utility model, his characterization requires strong observability of choices, i.e., the frequencies of choices must be observed from all subsets of the set of alternatives. Little is known, however, about the axiomatization when the frequencies on some choice sets are not observable. In fact, the problem of obtaining a tight characterization appears to be out of reach in most cases in view of a related NP-hard problem. We consider the following incomplete dataset. Let X be a finite set of alternatives. Let X* ⊆ X bea set of unobservable alternatives. Let D ⊆ 2X be the set of choice sets. We assume that the choice frequency ρ(D, x) is unobservable (i.e., not defined) if and only if x ∈ X* or D ∉ D. Let M* ≡ {(D,x)|x ∈ D ∈ 2X and [x ∈ X* or D ∉ D]} be the set of all pairs (D,x) such that ρ(D, x) is not observable. To state our theorem, for any ρ and (D, x) ∈ M ≡ {(D, x) ∈ D × X | x ∈ D}, define a Block-Marschak polynomial by K(ρ, D, x) = ΣE:E⊇D(−1)|E\D|ρ(E,x).
Haruki Kono, Kota Saito, Alec Sandroni
EC1