Pages that link to "Item:Q3455542"
From MaRDI portal
The following pages link to Truth revelation in approximately efficient combinatorial auctions (Q3455542):
Displayed 50 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- Optimal shill bidding in the VCG mechanism (Q431213) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions (Q543608) (← links)
- Incentives in core-selecting auctions with single-minded bidders (Q550207) (← links)
- Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- Auction design with costly preference elicitation (Q812389) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- GreedEx---a scalable clearing mechanism for utility computing (Q1020573) (← links)
- Mechanism design for set cover games with selfish element agents (Q1041237) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Mechanism design for land acquisition (Q1677251) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Characterization of ex post equilibrium in the VCG combinatorial auctions (Q1885425) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- Incentive compatible regression learning (Q1959425) (← links)
- Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity (Q1995288) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Dynamic communication mechanism design (Q2058846) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- A combinatorial double auction resource allocation model in cloud computing (Q2279671) (← links)
- Towards characterizing the deterministic combinatorial constrained efficient space (Q2290365) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Characterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilities (Q2346934) (← links)
- Revenue maximization with a single sample (Q2347785) (← links)
- The incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settings (Q2351253) (← links)
- Approximation in mechanism design with interdependent values (Q2357821) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)