Consensus of Subjective Probabilities: The Pari-Mutuel Method
From MaRDI portal
Publication:3258185
DOI10.1214/aoms/1177706369zbMath0087.13805OpenAlexW1980938853MaRDI QIDQ3258185
Publication date: 1959
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177706369
Related Items (71)
Shadow prices in territory division ⋮ Approximating the Nash Social Welfare with Indivisible Items ⋮ A Simplex-Like Algorithm for Fisher Markets ⋮ Sufficient weighted complementarity problems ⋮ On competitiveness in uniform utility allocation markets ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Characterization and Computation of Equilibria for Indivisible Goods ⋮ Prediction markets, Bayesian priors, and clinical trials ⋮ A consumer-theoretic characterization of Fisher market equilibria ⋮ Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings ⋮ ReGale: some memorable results ⋮ A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints ⋮ Computation of Fisher-Gale equilibrium by auction ⋮ Multiplicative Pacing Equilibria in Auction Markets ⋮ An additive approximation scheme for the Nash social welfare maximization with identical additive valuations ⋮ Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels ⋮ Funding public projects: a case for the Nash product rule ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality ⋮ A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property ⋮ An auction-based market equilibrium algorithm for a production model ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ Approximate competitive equilibrium with generic budget ⋮ Efficient Fair Division with Minimal Sharing ⋮ Incentive ratio: a game theoretical analysis of market equilibria ⋮ Equilibrium in prediction markets with buyers and sellers ⋮ Dividing bads under additive utilities ⋮ Market exchange models and geometric programming ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ EFX under budget constraint ⋮ Exact and approximation algorithms for PMMS under identical constraints ⋮ Fairly taking turns ⋮ Market Equilibria and Risk Diversification in Blockchain Mining Economies ⋮ Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms ⋮ Markets for efficient public good allocation with social distancing ⋮ Tatonnement beyond gross substitutes? Gradient descent to the rescue ⋮ The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function ⋮ Allocation, Lehrer models, and the consensus of probabilities ⋮ Racetrack betting and consensus of subjective probabilities. ⋮ Unnamed Item ⋮ Competitive communication spectrum economy and equilibrium ⋮ The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra ⋮ Markets for public decision-making ⋮ A path to the Arrow-Debreu competitive market equilibrium ⋮ Problems and methods of network control ⋮ An axiomatic characterization of wagering mechanisms ⋮ Proportional response dynamics in the Fisher market ⋮ Truthful aggregation of budget proposals ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ An incentive compatible, efficient market for air traffic flow management ⋮ A Truthful Mechanism for Offline Ad Slot Scheduling ⋮ PARAMETRIC ALGORITHM FOR A LINEAR EXCHANGE MODEL WITH SPENDING CONSTRAINTS ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Ascending-Price Algorithms for Unknown Markets ⋮ Polyhedral Complementarity on a Simplex: Search for Fixed Points of Decreasing Regular Mappings ⋮ On fair division for indivisible items ⋮ Efficient Advert Assignment ⋮ Convergence of a method for computing economic equilibria ⋮ An alternating algorithm for finding linear Arrow-Debreu market equilibria ⋮ Monotonicity and competitive equilibrium in cake-cutting ⋮ Fair and efficient cake division with connected pieces ⋮ Reducing models of general economic equilibrium to optimization problems. ⋮ Unnamed Item ⋮ Bipartite choices ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks ⋮ A combinatorial polynomial algorithm for the linear Arrow-Debreu market ⋮ How to allocate goods in an online market? ⋮ Fair Resource Allocation in a Volatile Marketplace ⋮ Computing Large Market Equilibria Using Abstractions ⋮ Nash Social Welfare Approximation for Strategic Agents
This page was built for publication: Consensus of Subjective Probabilities: The Pari-Mutuel Method
