AI Chat AI Image Generator AI Video Text to Speech

A short proof of a conjecture by Ben-Akiva and Lerman about the nested logit model

07/20/2019
∙
by   Alfred Galichon, et al.
∙
0
∙

We provide a short proof of a result by Cardell (1997) on a conjecture of Ben-Akiva and Lerman (1985) regarding the random utility representation of the nested logit model.

READ FULL TEXT

Related Research

research
∙ 07/20/2019

On a conjecture by Ben-Akiva and Lerman about the nested logit model

We prove a conjecture of Ben-Akiva and Lerman (1985) regarding the rando...
0 Alfred Galichon, et al. ∙
research
∙ 07/25/2011

Instantiation Schemes for Nested Theories

This paper investigates under which conditions instantiation-based proof...
0 Mnacho Echenim, et al. ∙
research
∙ 10/23/2018

A proof of the Shepp-Olkin entropy monotonicity conjecture

Consider tossing a collection of coins, each fair or biased towards head...
0 Erwan Hillion, et al. ∙
research
∙ 11/16/2021

On Bock's Conjecture Regarding the Adam Optimizer

In 2014, Kingma and Ba published their Adam optimizer algorithm, togethe...
11 Mohamed Akrout, et al. ∙
research
∙ 10/23/2019

Nested Conformal Prediction and the Generalized Jackknife+

We provide an alternate unified framework for conformal prediction, whic...
0 Arun K. Kuchibhotla, et al. ∙
research
∙ 10/14/2021

On some batch code properties of the simplex code

The binary k-dimensional simplex code is known to be a 2^k-1-batch code ...
0 Henk D. L. Hollmann, et al. ∙
research
∙ 10/23/2017

A short proof of the middle levels theorem

Consider the graph that has as vertices all bitstrings of length 2n+1 wi...
0 Petr Gregor, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal