Mechanisms with Monitoring for Truthful RAM Allocation
From MaRDI portal
Publication:3460805
DOI10.1007/978-3-662-48995-6_29zbMath1403.68024OpenAlexW2402812131MaRDI QIDQ3460805
Annamária Kovács, Ulrich Meyer, Carmine Ventre
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_29
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (2)
Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Average-case approximation ratio of scheduling without payments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Truthful optimization using mechanisms with verification
- Combinatorial auctions without money
- A necessary and sufficient condition for rationalizability in a quasilinear context
- Algorithms for memory hierarchies. Advanced lectures
- Optimal collusion-resistant mechanisms with verification
- Combinatorial auctions with verification are tractable
- Algorithms and Data Structures for External Memory
- On the Computational Power of Demand Queries
- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
- Competitive paging algorithms
- The Power of Verification for Greedy Mechanism Design
- Automata, Languages and Programming
- Algorithmic mechanism design
This page was built for publication: Mechanisms with Monitoring for Truthful RAM Allocation