Sciweavers

    SIGECOM
    2008
    ACM
    144views ECommerce» more  SIGECOM 2008»
    Incentives for expressing opinions in online polls
    14 years 11 days ago
    Incentives for expressing opinions in online polls
    Download  www.eecs.harvard.edu
    Prediction markets efficiently extract and aggregate the private information held by individuals about events and facts that can be publicly verified. However, facts such as the e...
    Radu Jurca, Boi Faltings
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    127views ECommerce» more  SIGECOM 2008»
    Posted prices vs. negotiations: an asymptotic analysis
    14 years 11 days ago
    Posted prices vs. negotiations: an asymptotic analysis
    Download  research.microsoft.com
    Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
    Liad Blumrosen, Thomas Holenstein
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    152views ECommerce» more  SIGECOM 2008»
    On characterizations of truthful mechanisms for combinatorial auctions and scheduling
    14 years 11 days ago
    On characterizations of truthful mechanisms for combinatorial auctions and scheduling
    Download  www.stanford.edu
    We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
    Shahar Dobzinski, Mukund Sundararajan
    claim paper
    Read More »
    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 »
    SIGECOM
    2008
    ACM
    94views ECommerce» more  SIGECOM 2008»
    Optimizing query rewrites for keyword-based advertising
    14 years 11 days ago
    Optimizing query rewrites for keyword-based advertising
    Download  www.cs.umd.edu
    We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
    Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    92views ECommerce» more  SIGECOM 2008»
    Strong regularities in online peer production
    14 years 11 days ago
    Strong regularities in online peer production
    Download  www.hpl.hp.com
    Online peer production systems have enabled people to coactively create, share, classify, and rate content on an unprecedented scale. This paper describes strong macroscopic regul...
    Dennis M. Wilkinson
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    108views ECommerce» more  SIGECOM 2008»
    Optimal envy-free pricing with metric substitutability
    14 years 11 days ago
    Optimal envy-free pricing with metric substitutability
    Download  theory.stanford.edu
    Ning Chen, Arpita Ghosh, Sergei Vassilvitskii
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    103views ECommerce» more  SIGECOM 2008»
    A sufficient condition for voting rules to be frequently manipulable
    14 years 11 days ago
    A sufficient condition for voting rules to be frequently manipulable
    Download  www.cs.duke.edu
    The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
    Lirong Xia, Vincent Conitzer
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    141views ECommerce» more  SIGECOM 2008»
    On the communication requirements of verifying the VCG outcome
    14 years 11 days ago
    On the communication requirements of verifying the VCG outcome
    Download  www.eecs.harvard.edu
    We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG paymen...
    Sébastien Lahaie, David C. Parkes
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    277views ECommerce» more  SIGECOM 2008»
    Efficiency and redistribution in dynamic mechanism design
    14 years 11 days ago
    Efficiency and redistribution in dynamic mechanism design
    Download  www.eecs.harvard.edu
    Ruggiero Cavallo
    claim paper
    Read More »
    « first‹ previous12345next ›last »
    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.