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
2
search results - page 1 / 1
»
On Problem Kernels for Possible Winner Determination under t...
Sort
relevance
views
votes
recent
update
View
thumb
title
29
click to vote
MFCS
2010
Springer
121
views
Theoretical Computer Science
»
more
MFCS 2010
»
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
13 years 9 months ago
Download
ccc.cs.uni-duesseldorf.de
Nadja Betzler
claim paper
Read More »
40
click to vote
IJCAI
2001
97
views
Artificial Intelligence
»
more
IJCAI 2001
»
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
14 years 6 days ago
Download
lang.is.kyushu-u.ac.jp
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »