Consensus of Subjective Probabilities: The Pari-Mutuel Method
From MaRDI portal
Cited in
(81)- Shadow prices in territory division
- An axiomatic characterization of wagering mechanisms
- Computing large market equilibria using abstractions
- How to allocate goods in an online market?
- Polyhedral complementarity on a simplex. Potentiality of regular mappings
- Approximating the Nash Social Welfare with Indivisible Items
- Over-the-Air computation for distributed machine learning and consensus in large wireless networks
- On competitiveness in uniform utility allocation markets
- Characterization and computation of equilibria for indivisible goods
- Racetrack betting and consensus of subjective probabilities.
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- ReGale: some memorable results
- The incentive guarantees behind Nash welfare in divisible resources allocation
- Fairly taking turns
- Allocation, Lehrer models, and the consensus of probabilities
- Parametric algorithm for a linear exchange model with spending constraints
- Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
- Market Equilibria and Risk Diversification in Blockchain Mining Economies
- Convergence of a method for computing economic equilibria
- Sufficient weighted complementarity problems
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Efficient Fair Division with Minimal Sharing
- Truthful aggregation of budget proposals
- Fair resource allocation in a volatile marketplace
- Bipartite choices
- Class fairness in online matching
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Equilibrium in prediction markets with buyers and sellers
- Online Nash welfare maximization without predictions
- Dividing bads under additive utilities
- Nash social welfare approximation for strategic agents
- Auction algorithms for market equilibrium with weak Gross substitute demands and their applications
- 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
- A Truthful Mechanism for Offline Ad Slot Scheduling
- A consumer-theoretic characterization of Fisher market equilibria
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Prediction markets, Bayesian priors, and clinical trials
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
- Ascending-price algorithms for unknown markets
- On fair division for indivisible items
- The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- Approximate competitive equilibrium with generic budget
- Multiplicative Pacing Equilibria in Auction Markets
- Fair and efficient cake division with connected pieces
- Incentive ratio: a game theoretical analysis of market equilibria
- Efficient advert assignment
- Computation of Fisher-Gale equilibrium by auction
- Connection of two approaches to the Fisher model
- Competitive communication spectrum economy and equilibrium
- A simplex-like algorithm for Fisher markets
- A full-Newton step feasible interior-point algorithm for solving the general Fisher market equilibrium
- Coordinating charitable donations with Leontief preferences
- Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods
- Monotonicity and competitive equilibrium in cake-cutting
- Markets for public decision-making
- A path to the Arrow-Debreu competitive market equilibrium
- Large-scale contextual market equilibrium computation through deep learning
- An alternating algorithm for finding linear Arrow-Debreu market equilibria
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Markets for efficient public good allocation with social distancing
- Market exchange models and geometric programming
- EFX under budget constraint
- Problems and methods of network control
- Proportional response dynamics in the Fisher market
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- 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
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
- Exact and approximation algorithms for PMMS under identical constraints
- Reducing models of general economic equilibrium to optimization problems.
- Sufficient weighted second-order cone complementarity problems
- The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
- Tatonnement beyond gross substitutes? Gradient descent to the rescue
- The price of equity with binary valuations and few agent types
This page was built for publication: Consensus of Subjective Probabilities: The Pari-Mutuel Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3258185)
