SearcharxivSearch

arXiv · 2504.19424

Positively Homogeneous Saddle-Functions and Euler's Theorem in Games

Abstract

Connections are made between solution concepts for games in characteristic function form and Euler's Theorem underlying the neo-classical theory of distribution in which the total output produced is imputed to the marginal products of the inputs producing it. The assumptions for Euler's Theorem are constant returns (positive homogeneity) and differentiability of the production function. Representing characteristic functions in a vector space setting, marginal products of commodity inputs are translated as marginal products of individuals. Marginal products for discrete (resp. infinitesimal) individuals are defined by discrete (resp. infinitesimal) directional derivates. Additivity of directional derivatives underlies the definition of differentiability in both discrete and infinitesimal settings. A key distinction is between characteristic functions defined by von Neumann and Morgenstern (vNM) which do not necessarily exhibit concavity and characteristic function that do. A modification of the definition, interpreted as introducing ``property rights,'' implies concavity. The Shapley value is a redefinition of an individual's marginal product for a (vNM) characteristic function. Concave characteristic functions do not require such redefinition. Concave characteristic functions imply the existence of positively homogeneous saddle-function functions whose saddle-points represent equilbria of the game. The saddle-point property applies to games with populations consisting of any number of individuals each type. When there is a small integer number of each type, the saddle-point property is often, but not always, inconsistent with the Euler condition, that each individual receives its marginal contribution. Conversely, the saddle-point condition is typically, but not always, consistent with the Euler condition when there are a large number of each type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph M. Ostroy, Joon Song. 2025-04-28. Positively Homogeneous Saddle-Functions and Euler's Theorem in Games. https://arxiv.org/abs/2504.19424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Social Preferences and Cooperation: Beliefs, Robustness, and the Limits of Altruism

We study a mechanism of cooperation in the Prisoner's Dilemma (PD). Incorporating social preferences as efficiency concerns into the PD game, we study how altruism translates into cooperation. Under complete information, cooperation requires the opponent's altruism to clear a threshold. We then introduce a subjective extension of Bayesian Nash equilibrium that relaxes the Common Prior Assumption, letting players hold heterogeneous, potentially misspecified beliefs about each other's altruistic type. Cooperation then depends on beliefs about altruism rather than altruism itself, and can be sustained even when opponents are, on average, only weakly altruistic. When fear of exploitation dominates the temptation to defect, beliefs about the opponent's cooperation become strategic complements, so a cooperative and an uncooperative equilibrium can coexist under identical payoffs and an identical, correctly specified prior. Using multiplier preferences, we then study how robust this belief-driven cooperation is to model misspecification. Cooperation is fragile: it survives only above a threshold level of confidence in one's own belief, and can unravel even when the belief itself correctly supports cooperation. As a formal extension, the same robust-control apparatus, applied to a player's action choice, nests Nash equilibrium, Bayesian Nash equilibrium, and logit Quantal Response Equilibrium as limiting cases. Cooperation depends less on how altruistic agents are than on what they believe about each other, and how confident they are that this belief is right.

econ.TH

Utility-Level-Dependent Ambiguity

Experimental evidence suggests that ambiguity-sensitive choice can vary systematically with the circumstances of a decision. This paper isolates one channel within a stable preference relation: ambiguity weighting may depend on the act's certainty-equivalent level. After the standard Anscombe-Aumann calibration of consequence utility, a set of behavioral axioms yields a unique continuous family of normalized monotone capacities $\{\nu_v\}_{v\in(0,1)}$. Each nonendpoint act is evaluated by the Choquet integral associated with the capacity at its own interior certainty-equivalent level, while nonendpoint acts on the same indifference surface share the same capacity. Binary event comparisons identify local event weights at each elicited level and trace their cross-level variation, providing tests of the fixed-capacity restriction. Local uncertainty aversion is equivalent to convexity of $\nu_v$ and yields an implicit multiple-priors representation with certainty-equivalent-indexed local cores. Certainty translation invariance holds if and only if the capacity is fixed across levels, recovering the maintained nondegenerate fixed-capacity Choquet expected utility benchmark; global mixture-betweenness yields implicit additive utility, and imposing both restrictions recovers full-support subjective expected utility. The capacity schedule is a reduced-form ambiguity weighting whose variation may reflect changes in ambiguity perception, ambiguity attitude, or both.

econ.TH

The Attention Cost of Stable Matching

In large markets, scarce attention limits partner evaluation and creates allocation loss, which stability magnifies. In an independent random market with average executable degree $d$, unmatched shares fall at rates $e^{-\sqrt d}$ under stability and $e^{-d}$ under maximum matching on the same graph. Changing consideration can make applications rejected in a provisional active-screen computation relevant again. Exact query-neutral implementation must retain allocation-relevant off-screen authorizations; otherwise, missing authorization must be reacquired. Limited-attention deferred acceptance (LA-DA) preserves valid authorizations and reengages eligible pairs. Conditional on exact next-best information and persistent execution rights, adaptive discovery saves a logarithmic factor in reached proposals relative to independent exposure. In an application to speed dating, bilateral reports let us compare stable and maximum matching on restricted graphs, separating missed opportunities from same-graph stability loss. In Chilean school choice, we document 9,502 applicants accepting higher-ranked or new placements through retained rankings.

econ.TH