Sciweavers

273 search results - page 34 / 55
» DEA based auctions
Sort
View
TASE
2008
IEEE
13 years 7 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 7 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
RAS
2007
161views more  RAS 2007»
13 years 6 months ago
Multi-robot mobility enhanced hop-count based localization in ad hoc networks
The localization problem is important in mobile robots and wireless sensor network and has been studied for many years. Among many localization methods, the hop-count based approa...
Terence Chung Hsin Sit, Zheng Liu, Marcelo H. Ang ...
MAGS
2006
79views more  MAGS 2006»
13 years 7 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Better redistribution with inefficient allocation in multi-unit auctions with unit demand
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
Mingyu Guo, Vincent Conitzer