Sciweavers

44 search results - page 1 / 9
» Bounding Rationality by Discounting Time
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 8 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
TKDE
2011
100views more  TKDE 2011»
13 years 3 months ago
Intertemporal Discount Factors as a Measure of Trustworthiness in Electronic Commerce
—In multiagent interactions, such as e-commerce and file sharing, being able to accurately assess the trustworthiness of others is important for agents to protect themselves fro...
Christopher J. Hazard, Munindar P. Singh
TARK
2009
Springer
14 years 3 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow

Publication
270views
15 years 7 months ago
Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids
Our attention is focused on designing an optimal procurement mechanism which a buyer can use for procuring multiple units of a homogeneous item based on bids submitted by autonomou...
N. Hemachandra, Raghav Kumar Gautam, V. Hastagiri ...