Pages that link to "Item:Q3258185"

The following pages link to Consensus of Subjective Probabilities: The Pari-Mutuel Method (Q3258185):

Displaying 50 items.

• How to allocate goods in an online market? (Q262246) (← links)
• Sufficient weighted complementarity problems (Q288407) (← links)
• Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels (Q383255) (← links)
• Competitive communication spectrum economy and equilibrium (Q489089) (← links)
• Problems and methods of network control (Q507101) (← links)
• Proportional response dynamics in the Fisher market (Q541676) (← links)
• Equilibrium in prediction markets with buyers and sellers (Q613424) (← links)
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra (Q670662) (← links)
• Fair and efficient cake division with connected pieces (Q776236) (← links)
• On competitiveness in uniform utility allocation markets (Q833560) (← links)
• Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
• A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property (Q883995) (← links)
• An auction-based market equilibrium algorithm for a production model (Q883996) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• Allocation, Lehrer models, and the consensus of probabilities (Q1164304) (← links)
• Convergence of a method for computing economic equilibria (Q1280981) (← links)
• Racetrack betting and consensus of subjective probabilities. (Q1423260) (← links)
• Reducing models of general economic equilibrium to optimization problems. (Q1580198) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
• Computation of Fisher-Gale equilibrium by auction (Q1656189) (← links)
• Truthful aggregation of budget proposals (Q2025032) (← links)
• An alternating algorithm for finding linear Arrow-Debreu market equilibria (Q2075387) (← links)
• Bipartite choices (Q2105872) (← links)
• Over-the-Air computation for distributed machine learning and consensus in large wireless networks (Q2106494) (← links)
• A consumer-theoretic characterization of Fisher market equilibria (Q2152128) (← links)
• An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
• Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
• Markets for public decision-making (Q2235098) (← links)
• An axiomatic characterization of wagering mechanisms (Q2253844) (← links)
• Monotonicity and competitive equilibrium in cake-cutting (Q2323302) (← links)
• A combinatorial polynomial algorithm for the linear Arrow-Debreu market (Q2347801) (← links)
• Shadow prices in territory division (Q2357931) (← links)
• Prediction markets, Bayesian priors, and clinical trials (Q2382894) (← links)
• ReGale: some memorable results (Q2389290) (← links)
• Dividing bads under additive utilities (Q2417409) (← links)
• Market exchange models and geometric programming (Q2418159) (← links)
• A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
• Funding public projects: a case for the Nash product rule (Q2668980) (← links)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• Approximate competitive equilibrium with generic budget (Q2670929) (← links)
• Incentive ratio: a game theoretical analysis of market equilibria (Q2672255) (← links)
• Markets for efficient public good allocation with social distancing (Q2692270) (← links)
• The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function (Q2698611) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• Efficient advert assignment (Q2830760) (← links)
• A Simplex-Like Algorithm for Fisher Markets (Q3162504) (← links)
• Characterization and Computation of Equilibria for Indivisible Goods (Q3449598) (← links)
• Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings (Q4553655) (← links)
• Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)