Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
11
search results - page 3 / 3
»
Integer and fractional packings of hypergraphs
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
FOCS
2005
IEEE
114
views
Theoretical Computer Science
»
more
FOCS 2005
»
Truthful and Near-Optimal Mechanism Design via Linear Programming
13 years 11 months ago
Download
ist.caltech.edu
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
claim paper
Read More »
« Prev
« First
page 3 / 3
Last »
Next »