Similar Search Results

The Resource Allocation Problem with Feedback

Ichimori, Tetsuo; Moriguchi, Satoko - In: Journal of the Operations Research Society of Japan : JORSJ 1 (2005), pp. 11-24

Persistent link: https://www.econbiz.de/10006714115

On Discrete Hessian Matrix and Convex Extensibility

Moriguchi, Satoko; Murota, Kazuo - In: Journal of the Operations Research Society of Japan : JORSJ 55 (2012) 1, pp. 48-63

Persistent link: https://www.econbiz.de/10009966085

Discrete midpoint convexity

Moriguchi, Satoko; Murota, Kazuo; Tamura, Akihisa; … - In: Mathematics of operations research 45 (2020) 1, pp. 99-128

Persistent link: https://www.econbiz.de/10012183023

Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints

Shioura, Akiyoshi - In: Mathematics of operations research 40 (2015) 1, pp. 192-225

Persistent link: https://www.econbiz.de/10010497624

M-convex function minimization under l1-distance constraint and its application to dock reallocation in bike-sharing system

Shioura, Akiyoshi - In: Mathematics of operations research 47 (2022) 2, pp. 1566-1611

Persistent link: https://www.econbiz.de/10013365334

Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis

Murota, Kazuo; Shioura, Akiyoshi; Yang, Zaifu - Department of Economics and Related Studies, University … - 2014

We examine an auction model where there are many different goods, each good has multiple units, and bidders have gross substitutes valuations over the goods. We analyze the number of iterations in iterative auction algorithms for the model based on the theory of discrete convex analysis. By...

Persistent link: https://www.econbiz.de/10011124369