Robust combinatorial auction protocol against false-name bids
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2131742
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- scientific article; zbMATH DE number 1927236
- scientific article; zbMATH DE number 773971
- False-name-proof combinatorial auction design via single-minded decomposition
Cites work
Cited in
(15)- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- Combinatorial auctions with decreasing marginal utilities
- On the choice of obtaining and disclosing the common value in auctions
- scientific article; zbMATH DE number 2131742 (Why is no real title available?)
- Optimal bidding in auctions from a game theory perspective
- False-name-proof voting with costs over two alternatives
- scientific article; zbMATH DE number 1927236 (Why is no real title available?)
- Agent-based product-support logistics system using XML and RDF
- False-name-proof combinatorial auction design via single-minded decomposition
- Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
- Trends of internet auctions and agent-mediated web commerce
- Comparing multiagent systems research in combinatorial auctions and voting
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
- A choice of auction format in seller cheating: a signaling game analysis
- Protocol completion incentive problems in cryptographic Vickrey auctions
This page was built for publication: Robust combinatorial auction protocol against false-name bids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941555)