Sciweavers

84 search results - page 8 / 17
» On maximizing welfare when utility functions are subadditive
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 4 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
PODC
2004
ACM
14 years 27 days ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
MANSCI
2007
70views more  MANSCI 2007»
13 years 7 months ago
Optimal Risk Taking with Flexible Income
We study the portfolio selection problem of an investor who can optimally exert costly effort for more income. The possibility of generating more income, if necessary, increases ...
Jaksa Cvitanic, Levon Goukasian, Fernando Zapatero