Sciweavers

    SIGECOM
    2008
    ACM
    155views ECommerce» more  SIGECOM 2008»
    Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
    14 years 11 days ago
    Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
    Download  www.cs.huji.ac.il
    We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
    Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
    claim paper
    Read More »
    SAGT
    2009
    Springer
    177views Game Theory» more  SAGT 2009»
    Characterizing Incentive Compatibility for Convex Valuations
    14 years 7 months ago
    Characterizing Incentive Compatibility for Convex Valuations
    Download  www.econ.hit-u.ac.jp
    We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
    André Berger, Rudolf Müller, Seyed Hos...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.