Pages that link to "Item:Q2506310"
From MaRDI portal
The following pages link to Combinatorial auctions with decreasing marginal utilities (Q2506310):
Displaying 50 items.
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Identifying combinatorial valuations from aggregate demand (Q406412) (← links)
- Optimal shill bidding in the VCG mechanism (Q431213) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Informational limitations of ascending combinatorial auctions (Q972880) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- Stability and auctions in labor markets with job security (Q1783457) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Walrasian's characterization and a universal ascending auction (Q2013362) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Directed discrete midpoint convexity (Q2024598) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Combinatorial auctions with endowment effect (Q2100637) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint (Q2149857) (← links)
- Policies for risk-aware sensor data collection by mobile agents (Q2151909) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
- Pricing multi-unit markets (Q2190388) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- A unifying look at sequence submodularity (Q2238597) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- Online pricing for multi-type of items (Q2257292) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
