On the Computational Power of Demand Queries
From MaRDI portal
Publication:3586184
DOI10.1137/050641181zbMath1193.91027OpenAlexW2048404446MaRDI QIDQ3586184
Publication date: 6 September 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1a420bbe4a5ffabff3bd0185af491d51c15e6681
Games involving graphs (91A43) Signaling and communication in game theory (91A28) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Communication theory (94A05)
Related Items (15)
Combinatorial Walrasian Equilibrium ⋮ Mechanisms with Monitoring for Truthful RAM Allocation ⋮ Iterative Auction Design for Tree Valuations ⋮ Communication complexity of approximate Nash equilibria ⋮ Optimization with demand oracles ⋮ Ascending prices and package bidding: further experimental analysis ⋮ Optimization with uniform size queries ⋮ Informational limitations of ascending combinatorial auctions ⋮ On the robustness of non-linear personalized price combinatorial auctions ⋮ Combinatorial auctions with verification are tractable ⋮ Computing Walrasian equilibria: fast algorithms and structural properties ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Unnamed Item ⋮ Fair by design: multidimensional envy-free mechanisms ⋮ Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online
This page was built for publication: On the Computational Power of Demand Queries
