Sciweavers

65 search results - page 7 / 13
» Item Pricing for Revenue Maximization in Combinatorial Aucti...
Sort
View
93
Voted
WINE
2009
Springer
117views Economy» more  WINE 2009»
15 years 6 months ago
Envy-Free Allocations for Budgeted Bidders
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
David Kempe, Ahuva Mu'alem, Mahyar Salek
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 6 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
110
Voted
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 7 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
116
Voted
WINE
2007
Springer
151views Economy» more  WINE 2007»
15 years 5 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
90
Voted
AAAI
2008
15 years 2 months ago
Bidding Strategies for Realistic Multi-Unit Sealed-Bid Auctions
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditiona...
Ioannis A. Vetsikas, Nicholas R. Jennings