Random allocations of multiple objects with incomplete information

DOI10.1016/J.JET.2025.106131MaRDI QIDQ7227633zbMATH OpenFDO

Authors Xu Lang, Zaifu Yang

Publication date 10 April 2026

Published in Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JET.2025.106131

zbMATH Keywords

allocation mechanismdistributional constraintsincomplete informationindivisible objectstotal unimodularity

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• \(M\)-convex function on generalized polymatroid
• A new solution to the random assignment problem.
• A Note on Kelso and Crawford's Gross Substitutes Condition
• Assignment Problems and the Location of Economic Activities
• Characterizing and recognizing generalized polymatroids
• Computationally manageable combinational auctions
• Course bidding at business schools
• Decomposition of regular matroids
• Discrete Convex Analysis
• Efficient computation of optimal auctions via reduced forms
• Efficient mechanisms for bilateral trading
• Generalized reduced-form auctions: a network-flow approach
• Graph theory with applications
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 2084778 (Why is no real title available?)
• Implementation of Reduced Form Auctions: A Geometric Approach
• Improving matching under hard distributional constraints
• Job matching with heterogeneous firms and workers
• Job Matching, Coalition Formation, and Gross Substitutes
• On the Implementability of Reduced Form Auctions
• Optimal Auctions with Risk Averse Buyers
• Recognizing graphic matroids
• Reduced form auctions revisited
• Reduced form implementation for environments with value interdependencies
• School choice with controlled choice constraints: hard bounds versus soft bounds
• Sharing a river.
• Strong Tiebout equilibrium under restricted preferences domain
• Symmetric reduced-form voting
• The assignment game. I: The core
• The average tree solution for cooperative games with communication structure
• The college admissions problem with lower and common quotas
• The perfectly matchable subgraph polytope of a bipartite graph
• Total unimodularity and combinatorial theorems
• Unimodular matrices of flow problems with additional constraints
• Walrasian equilibrium with gross substitutes

This page was built for publication: Random allocations of multiple objects with incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227633)