<p>Given a universe of choices $X$, subsets of alternatives $A \subseteq X$, and choice probabilities $\Pi_{A}(x)$ for item $x \in A \subseteq X$, the Block-Marschak polynomials can be defined recursively as (see McFadden, <em>Revealed stochastic preference:
a synthesis</em>, 2005) as</p>

<p>$K_{x, \emptyset} = \Pi_{X}(x) \,, \quad K_{x, A} = \Pi_{X\setminus A}(x) - \sum_{C \subset A} K_{x, C}$</p>

<p>When the choice probabilities are the result of utility maximization, Barbara and Pattanaik (<em>Falmagne and the rationalizability of stochastic choices in terms of random orderings</em>, 1986) provide a useful and intuitive interpretation of $K_{x,A}$ as the probability of the event that $x$ is ranked behind the elements of $A$ and ahead of all the remaining elements in $X \setminus A$.</p>

CC BY-SA 3.0
2015-01-14T20:55:11.280Z
Thanks for the nice answer, the interpretation is still difficult since it is still given in terms of the representation. I would have liked an IIA or Sen's $alpha$, $\beta$ axioms/characterization.
user157623
CC BY-SA 3.0
2015-01-14T21:15:57.303Z
@user157623 I find the probability of being ranked between elements of $A$ and $X \setminus A$ rather intuitive. BTW, the recursive definition can also be solved using Mobius inversion. The algebraic structure is very similar to the Shapley value in cooperative game theory, where instead of choice sets and marginal probabilities you have coalitions and marginal contributions. The Shapley value gives the average marginal value to all coalitions. Perhaps you can interpret these polynomials as the average choice probability among all choice sets.
TemplateRex
CC BY-SA 3.0
2015-01-14T10:57:16.857Z
2015-01-14T10:57:16.857Z
TemplateRex
<p>Can someone explain intuitively, the Block-Marschack Polynomials that completely characterize random utility. </p>

CC BY-SA 3.0
2015-01-13T03:43:44.823Z
Do you know of the paper where they are first defined? Or, do you have a reference to any paper that uses them?
jmbejara
CC BY-SA 3.0
2015-01-14T11:15:42.983Z
@jmbejara the original work was done in Block, Henry David, and Jacob Marschak. "Random orderings and stochastic theories of responses." Contributions to probability and statistics 2 (1960): 97-132. See my anwer below for a modern notation based on McFadden.
TemplateRex
<microeconomics><mathematical-economics><decision-theory>
Random Utility interpretation
user157623
# Random Utility interpretation

(Asked by: username_0 on 2015-01-13)

Can someone explain intuitively, the Block-Marschack Polynomials that completely characterize random utility.

**Tags:** microeconomics, mathematical-economics, decision-theory

> **Comments:**
> **username_1**: Do you know of the paper where they are first defined? Or, do you have a reference to any paper that uses them?  
> **username_2**: @username_1 the original work was done in Block, Henry David, and Jacob Marschak. "Random orderings and stochastic theories of responses." Contributions to probability and statistics 2 (1960): 97-132. See my anwer below for a modern notation based on McFadden.  

---

## 1 answers

### Answer by username_2 on 2015-01-14. Score: 2

Given a universe of choices $X$, subsets of alternatives $A \subseteq X$, and choice probabilities $\Pi\_{A}(x)$ for item $x \in A \subseteq X$, the Block-Marschak polynomials can be defined recursively as (see McFadden, *Revealed stochastic preference:
a synthesis*, 2005) as

$K\_{x, \emptyset} = \Pi\_{X}(x) \,, \quad K\_{x, A} = \Pi\_{X\setminus A}(x) - \sum\_{C \subset A} K\_{x, C}$

When the choice probabilities are the result of utility maximization, Barbara and Pattanaik (*Falmagne and the rationalizability of stochastic choices in terms of random orderings*, 1986) provide a useful and intuitive interpretation of $K\_{x,A}$ as the probability of the event that $x$ is ranked behind the elements of $A$ and ahead of all the remaining elements in $X \setminus A$.

> **Comments:**
> **username_0**: Thanks for the nice answer, the interpretation is still difficult since it is still given in terms of the representation. I would have liked an IIA or Sen's $alpha$, $\beta$ axioms/characterization.  
> **username_2**: @username_0 I find the probability of being ranked between elements of $A$ and $X \setminus A$ rather intuitive. BTW, the recursive definition can also be solved using Mobius inversion. The algebraic structure is very similar to the Shapley value in cooperative game theory, where instead of choice sets and marginal probabilities you have coalitions and marginal contributions. The Shapley value gives the average marginal value to all coalitions. Perhaps you can interpret these polynomials as the average choice probability among all choice sets.  

---

