scientific article; zbMATH DE number 6783425

zbMath1377.90113arXiv1007.3801MaRDI QIDQ5365073

Pinyan Lu, Ning Chen, N. V. Gravin

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1007.3801

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (19)

Tight Revenue Gaps among Multiunit Mechanisms ⋮ Ex-post optimal knapsack procurement ⋮ Mechanisms for dual-role-facility location games: truthfulness and approximability ⋮ Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Budget-feasible mechanisms for proportionally selecting agents from groups ⋮ A simple mechanism for a budget-constrained buyer ⋮ Simple and efficient budget feasible mechanisms for monotone submodular valuations ⋮ Budget-feasible Sybil-proof mechanisms for crowdsensing ⋮ Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design ⋮ Budget-feasible Sybil-proof mechanisms for crowdsensing ⋮ Budget feasible mechanisms for procurement auctions with divisible agents ⋮ An online sequential procurement mechanism under uncertain demands in multi-cloud environment ⋮ Hardness of and approximate mechanism design for the bike rebalancing problem ⋮ Budget Feasible Procurement Auctions ⋮ Auction mechanisms for allocating subsidies for carbon emissions reduction: an experimental investigation ⋮ Budget feasible mechanisms on matroids ⋮ Worst-Case Mechanism Design via Bayesian Analysis ⋮ Selling privacy at auction ⋮ Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online

This page was built for publication: