On improved interval cover mechanisms for crowdsourcing markets
From MaRDI portal
Publication:6164503
DOI10.1007/978-3-031-15714-1_6zbMath1520.91094OpenAlexW4297821727MaRDI QIDQ6164503
Evangelos Markakis, Artem Tsikiridis, Georgios Papasotiropoulos
Publication date: 28 July 2023
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15714-1_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximability of sparse integer programs
- Caching is hard -- even in the fault model
- Off-line admission control for general scheduling problems
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Approximation algorithms for covering/packing integer programs
- A quasi-PTAS for unsplittable flow on line graphs
- Integer Programming with a Fixed Number of Variables
- Resource Allocation for Covering Time Varying Demands
- Approximation Techniques for Utilitarian Mechanism Design
- Truth revelation in approximately efficient combinatorial auctions
- On Column-Restricted and Priority Covering Integer Programs
- Optimal Auction Design
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Improved Algorithm for Resource Allocation Problems
- Integer Programming in Parameterized Complexity: Three Miniatures.
- Approximating Geometric Knapsack via L-packings
- The Geometry of Scheduling
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
- Approximation and Online Algorithms
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: On improved interval cover mechanisms for crowdsourcing markets