Two-way greedy: algorithms for imperfect rationality
From MaRDI portal
Publication:2152097
DOI10.1007/978-3-030-94676-0_1OpenAlexW4206748588MaRDI QIDQ2152097
Diodato Ferraioli, Carmine Ventre, Paolo Penna
Publication date: 6 July 2022
Full work available at URL: https://arxiv.org/abs/2007.11868
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Related Items (1)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Automated optimal OSP mechanisms for set systems. The case of small domains
- (Incremental) priority algorithms
- A revelation principle for obviously strategy-proof implementation
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- A survey of heuristics for the weighted matching problem
- Truth revelation in approximately efficient combinatorial auctions
- Worst case analysis of greedy type algorithms for independence systems
- The Performance of Deferred-Acceptance Auctions
- Algorithmic Game Theory
This page was built for publication: Two-way greedy: algorithms for imperfect rationality
